NotificationsYou must be signed in to change notification settings
Fork0
Star0

Commit1d02cd4

authored

Merge pull requestTheAlgorithms#711 from ojasiiitd/patch-1

Updated StackOfLinkedList.java

2 parentsdda712c +2ea5340 commit1d02cd4Copy full SHA for 1d02cd4

File tree

1 file changed

+25

-24

lines changed

DataStructures/Stacks
- StackOfLinkedList.java

1 file changed

+25

-24

lines changed

`‎DataStructures/Stacks/StackOfLinkedList.java`

Lines changed: 25 additions & 24 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,5 @@`
`1`	`1`	`/**`
`2`		`- *`
`3`	`2`	`* @author Varun Upadhyay (https://github.com/varunu28)`
`4`		`- *`
`5`	`3`	`*/`
`6`	`4`
`7`	`5`	`// An implementation of a Stack using a Linked List`
`@@ -25,9 +23,7 @@ public static void main(String[] args) {`
`25`	`23`	`stack.pop();`
`26`	`24`
`27`	`25`	`System.out.println("Top element of stack currently is: " +stack.peek());`
`28`		`-`
`29`	`26`	`}`
`30`		`-`
`31`	`27`	`}`
`32`	`28`
`33`	`29`	`// A node class`
`@@ -44,66 +40,71 @@ public Node(int data) {`
`44`	`40`
`45`	`41`	`/**`
`46`	`42`	`* A class which implements a stack using a linked list`
`47`		`- *`
	`43`	`+ * <p>`
`48`	`44`	`* Contains all the stack methods : push, pop, printStack, isEmpty`
`49`	`45`	`**/`
`50`	`46`
`51`	`47`	`classLinkedListStack {`
`52`	`48`
`53`	`49`	`Nodehead =null;`
`54`		`-intsize =0;`
`55`	`50`
`56`	`51`	`publicvoidpush(intx) {`
`57`	`52`	`Noden =newNode(x);`
`58`		`-if (getSize() ==0) {`
	`53`	`+if (head ==null) {`
`59`	`54`	`head =n;`
`60`		`- }`
`61`		`-else {`
	`55`	`+ }else {`
`62`	`56`	`Nodetemp =head;`
`63`	`57`	`n.next =temp;`
`64`	`58`	`head =n;`
`65`	`59`	`}`
`66`		`-size++;`
`67`	`60`	`}`
`68`	`61`
`69`	`62`	`publicvoidpop() {`
`70`		`-if (getSize() ==0) {`
	`63`	`+if (head ==null) {`
`71`	`64`	`System.out.println("Empty stack. Nothing to pop");`
`72`	`65`	`}`
`73`	`66`
`74`	`67`	`Nodetemp =head;`
`75`	`68`	`head =head.next;`
`76`		`-size--;`
`77`		`-`
`78`	`69`	`System.out.println("Popped element is: " +temp.data);`
`79`	`70`	`}`
`80`	`71`
`81`	`72`	`publicintpeek() {`
`82`		`-if (getSize() ==0) {`
`83`		`-return -1;`
`84`		`- }`
`85`		`-`
`86`		`-returnhead.data;`
	`73`	`+if (head ==null) {`
	`74`	`+return -1;`
	`75`	`+ }`
	`76`	`+returnhead.data;`
`87`	`77`	`}`
`88`	`78`
`89`	`79`	`publicvoidprintStack() {`
`90`		`-`
`91`	`80`	`Nodetemp =head;`
`92`	`81`	`System.out.println("Stack is printed as below: ");`
`93`	`82`	`while (temp !=null) {`
`94`		`-System.out.println(temp.data +" ");`
	`83`	`+if (temp.next ==null) {`
	`84`	`+System.out.print(temp.data);`
	`85`	`+ }else {`
	`86`	`+System.out.print(temp.data +" -> ");`
	`87`	`+ }`
`95`	`88`	`temp =temp.next;`
`96`	`89`	`}`
`97`	`90`	`System.out.println();`
`98`		`-`
`99`	`91`	`}`
`100`	`92`
`101`	`93`	`publicbooleanisEmpty() {`
`102`		`-returngetSize() ==0;`
	`94`	`+returnhead ==null;`
`103`	`95`	`}`
`104`	`96`
`105`	`97`	`publicintgetSize() {`
`106`		`-returnsize;`
	`98`	`+if (head ==null)`
	`99`	`+return0;`
	`100`	`+else {`
	`101`	`+intsize =1;`
	`102`	`+Nodetemp =head;`
	`103`	`+while (temp.next !=null) {`
	`104`	`+temp =temp.next;`
	`105`	`+size++;`
	`106`	`+ }`
	`107`	`+returnsize;`
	`108`	`+ }`
`107`	`109`	`}`
`108`		`-`
`109`	`110`	`}`

0 commit comments

Comments

(0)

Movatterモバイル変換

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit1d02cd4

File tree

1 file changed

1 file changed

`‎DataStructures/Stacks/StackOfLinkedList.java`

0 commit comments