Commit7be6b4b

committed

add 92

1 parent403abae commit7be6b4bCopy full SHA for 7be6b4b

File tree

+50

-1

lines changed

+50

-1

lines changed

Lines changed: 13 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -11,7 +11,7 @@`
`11`	`11`	`*/`
`12`	`12`	`// Iterative way`
`13`	`13`	`varreverseList=function(head){`
`14`		`-if(head===null\|\|head.next===null)returnhead;`
	`14`	`+if(head===null\|\|head.next===null)returnhead;`
`15`	`15`	`varheadNext=head.next;`
`16`	`16`	`head.next=null;`
`17`	`17`	`while(head!==null&&headNext!==null){`
`@@ -25,6 +25,18 @@ var reverseList = function(head) {`
`25`	`25`	`returnhead;`
`26`	`26`	`};`
`27`	`27`
	`28`	`+// a more concise solution, prevHead eventually wll be the reversed list head`
	`29`	`+varreverseList=function(head){`
	`30`	`+varprevHead=null;`
	`31`	`+while(head){`
	`32`	`+varheadNext=head.next;`
	`33`	`+head.next=prevHead;`
	`34`	`+prevHead=head;`
	`35`	`+head=headNext;`
	`36`	`+}`
	`37`	`+returnprevHead;`
	`38`	`+};`
	`39`	`+`
`28`	`40`	`// recursive way`
`29`	`41`	`varreverseList=function(head){`
`30`	`42`	`if(head===null\|\|head.next===null)returnhead;`

Lines changed: 36 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,36 @@`
	`1`	`+/**`
	`2`	`+ * Definition for singly-linked list.`
	`3`	`+ * function ListNode(val) {`
	`4`	`+ * this.val = val;`
	`5`	`+ * this.next = null;`
	`6`	`+ * }`
	`7`	`+ */`
	`8`	`+/**`
	`9`	`+ *@param {ListNode} head`
	`10`	`+ *@param {number} m`
	`11`	`+ *@param {number} n`
	`12`	`+ *@return {ListNode}`
	`13`	`+ */`
	`14`	`+varreverseBetween=function(head,m,n){`
	`15`	`+vardummyHead=newListNode(null);`
	`16`	`+dummyHead.next=head;`
	`17`	`+varpre=dummyHead;`
	`18`	`+`
	`19`	`+for(vari=1;i<m;i++){`
	`20`	`+pre=pre.next;`
	`21`	`+}`
	`22`	`+`
	`23`	`+varcurr=pre.next;`
	`24`	`+varnewHead=pre;`
	`25`	`+for(vari=0;i<=n-m;i++){`
	`26`	`+varcurrNext=curr.next;`
	`27`	`+curr.next=pre;`
	`28`	`+pre=curr;`
	`29`	`+curr=currNext;`
	`30`	`+}`
	`31`	`+// reset the head and tail pointers`
	`32`	`+newHead.next.next=curr;`
	`33`	`+newHead.next=pre;`
	`34`	`+`
	`35`	`+returndummyHead.next;`
	`36`	`+};`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -94,6 +94,7 @@`
`94`	`94`	`*[77.Combinations](https://leetcode.com/problems/combinations/) -[Solution](./Medium/77-combinations.js)`
`95`	`95`	`*[80. Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) -[Solution](./Medium/80-removeDuplicatesII.js)`
`96`	`96`	`*[89. Gray Code](https://leetcode.com/problems/gray-code/) -[Solution](./Medium/89-grayCode.js)`
	`97`	`+*[92. Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/) -[Solution](./Medium/92-reverseLinkedListII.js)`
`97`	`98`	`*[94. Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) -[Solution](./Medium/94-binaryTreeInorder.js)`
`98`	`99`	`*[96. Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/) -[Solution](./Medium/96-uniqueBinarySearchTrees.js)`
`99`	`100`	`*[108. Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/) -[Solution](./Medium/108-convertSortedArraytoBST.js)`

Comments

(0)