Commit9bb1d5f

committed

refactor 25

1 parent98f2363 commit9bb1d5fCopy full SHA for 9bb1d5f

File tree

-5

lines changed

src
- main/java/com/fishercoder/solutions
  - _25.java
- test/java/com/fishercoder
  - _25Test.java

-5

lines changed

Lines changed: 7 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -4,8 +4,10 @@`
`4`	`4`
`5`	`5`	`publicclass_25 {`
`6`	`6`
`7`		`-/**We use recursion to go all the way until the end: when the number of nodes are smaller than k;`
`8`		`- * then we start to reverse each group of k nodes from the end towards the start.*/`
	`7`	`+/**`
	`8`	`+ * We use recursion to go all the way until the end: when the number of nodes are smaller than k;`
	`9`	`+ * then we start to reverse each group of k nodes from the end towards the start.`
	`10`	`+ */`
`9`	`11`	`publicstaticclassSolution1 {`
`10`	`12`	`publicListNodereverseKGroup(ListNodehead,intk) {`
`11`	`13`	`ListNodecurr =head;`
`@@ -44,16 +46,16 @@ public ListNode reverseKGroup(ListNode head, int k) {`
`44`	`46`	`intn =0;// number of nodes`
`45`	`47`
`46`	`48`	`ListNodecurr =head;`
`47`		`-while(curr !=null){`
`48`		`-n++;`
	`49`	`+while(curr !=null){`
	`50`	`+n++;`
`49`	`51`	`curr =curr.next;`
`50`	`52`	`}`
`51`	`53`
`52`	`54`	`ListNodeprev =null;`
`53`	`55`	`ListNodenext =null;`
`54`	`56`	`ListNodenewHead =null;`
`55`	`57`	`ListNodetail1 =null;`
`56`		`-ListNodetail2 =head;`
	`58`	`+ListNodetail2 =head;`
`57`	`59`
`58`	`60`	`curr =head;`
`59`	`61`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -28,6 +28,7 @@ public void test1() {`
`28`	`28`	`expected =LinkedListUtils.contructLinkedList(newint[]{2,1,4,3,5});`
`29`	`29`	`assertEquals(actual,expected);`
`30`	`30`	`}`
	`31`	`+`
`31`	`32`	`@Test`
`32`	`33`	`publicvoidtest2() {`
`33`	`34`	`head =LinkedListUtils.contructLinkedList(newint[]{1,2,3,4,5,6,7});`

Comments

(0)