Commit355226b

authored

Merge pull requestneetcode-gh#2448 from KhizarShabir1/update_solution_of_reverse-linked-list

simplified code to only use two named pointers in reverese linked list (C++)

2 parentsfc3582a +b9c3419 commit355226bCopy full SHA for 355226b

File tree

+14

-14

lines changed

+14

-14

lines changed

Lines changed: 14 additions & 14 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,7 +2,7 @@`
`2`	`2`	`Given the head of a singly linked list, reverse list & return`
`3`	`3`	`Ex. head = [1,2,3,4,5] -> [5,4,3,2,1], head = [1,2] -> [2,1]`
`4`	`4`
`5`		`- Maintain prev, curr, & next pointers, iterate thru & reverse`
	`5`	`+ Maintain prev, curr pointers, iterate thru & reverse`
`6`	`6`
`7`	`7`	`Time: O(n)`
`8`	`8`	`Space: O(1)`
`@@ -18,24 +18,24 @@`
`18`	`18`	`* ListNode(int x, ListNode *next) : val(x), next(next) {}`
`19`	`19`	`* };`
`20`	`20`	`*/`
`21`		`-classSolution {`
	`21`	`+classSolution`
	`22`	`+{`
`22`	`23`	`public:`
`23`		`- ListNodereverseList(ListNode head) {`
`24`		`-if (head ==NULL \|\| head->next ==NULL) {`
	`24`	`+ ListNode reverseList(ListNode head)`
	`25`	`+ {`
	`26`	`+if (head ==NULL \|\| head->next ==NULL)`
`25`	`27`	`return head;`
`26`		`- }`
`27`		`-`
`28`		`- ListNode* prev =NULL;`
`29`		`- ListNode* curr = head;`
`30`		`- ListNode* next = curr->next;`
`31`		`-`
`32`		`-while (curr !=NULL) {`
`33`		`- next = curr->next;`
	`28`	`+`
	`29`	`+ ListNode *prev =NULL;`
	`30`	`+ ListNode *curr = head;`
	`31`	`+`
	`32`	`+while (curr !=NULL)`
	`33`	`+ {`
	`34`	`+ ListNode *temp = curr->next;`
`34`	`35`	`curr->next = prev;`
`35`	`36`	`prev = curr;`
`36`		`- curr =next;`
	`37`	`+ curr =temp;`
`37`	`38`	`}`
`38`		`-`
`39`	`39`	`return prev;`
`40`	`40`	`}`
`41`	`41`	`};`

Comments

(0)