Commitd5901a3

committed

add a solution for 206

1 parent599429f commitd5901a3Copy full SHA for d5901a3

File tree

+27

-0

lines changed

src
- main/java/com/fishercoder/solutions
  - _206.java
- test/java/com/fishercoder
  - _206Test.java

+27

-0

lines changed

Lines changed: 19 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -34,4 +34,23 @@ ListNode reverse(ListNode head, ListNode newHead) {`
`34`	`34`	`}`
`35`	`35`	`}`
`36`	`36`
	`37`	`+publicstaticclassSolution3 {`
	`38`	`+`
	`39`	`+/**`
	`40`	`+ * I feel like using the variable called prev makes more sense to me on 10/25/2021`
	`41`	`+ * since it's literally a previous node when we start reversing from the head of the list.`
	`42`	`+ * Again, using a pen and paper to visualize the steps helps a lot to convert thoughts into code.`
	`43`	`+ */`
	`44`	`+publicListNodereverseList(ListNodehead) {`
	`45`	`+ListNodeprev =null;`
	`46`	`+while (head !=null) {`
	`47`	`+ListNodenext =head.next;`
	`48`	`+head.next =prev;`
	`49`	`+prev =head;`
	`50`	`+head =next;`
	`51`	`+ }`
	`52`	`+returnprev;`
	`53`	`+ }`
	`54`	`+ }`
	`55`	`+`
`37`	`56`	`}`

Lines changed: 8 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -11,12 +11,14 @@`
`11`	`11`	`publicclass_206Test {`
`12`	`12`	`privatestatic_206.Solution1solution1;`
`13`	`13`	`privatestatic_206.Solution2solution2;`
	`14`	`+privatestatic_206.Solution3solution3;`
`14`	`15`	`privatestaticListNodehead;`
`15`	`16`
`16`	`17`	`@BeforeClass`
`17`	`18`	`publicstaticvoidsetup() {`
`18`	`19`	`solution1 =new_206.Solution1();`
`19`	`20`	`solution2 =new_206.Solution2();`
	`21`	`+solution3 =new_206.Solution3();`
`20`	`22`	`}`
`21`	`23`
`22`	`24`	`@Test`
`@@ -30,4 +32,10 @@ public void test2() {`
`30`	`32`	`head =LinkedListUtils.contructLinkedList(newint[]{1,2,3,4});`
`31`	`33`	`assertEquals(LinkedListUtils.contructLinkedList(newint[]{4,3,2,1}),solution2.reverseList(head));`
`32`	`34`	`}`
	`35`	`+`
	`36`	`+@Test`
	`37`	`+publicvoidtest3() {`
	`38`	`+head =LinkedListUtils.contructLinkedList(newint[]{1,2,3,4});`
	`39`	`+assertEquals(LinkedListUtils.contructLinkedList(newint[]{4,3,2,1}),solution3.reverseList(head));`
	`40`	`+ }`
`33`	`41`	`}`

Comments

(0)