refactor 25

fishercoder1534 · fishercoder1534 · commit 9bb1d5f0f0bf · 2021-02-26T17:39:11.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_25.java b/src/main/java/com/fishercoder/solutions/_25.java
@@ -4,8 +4,10 @@
 
 public class _25 {
 
-    /**We use recursion to go all the way until the end: when the number of nodes are smaller than k;
-     * then we start to reverse each group of k nodes from the end towards the start.*/
+    /**
+     * We use recursion to go all the way until the end: when the number of nodes are smaller than k;
+     * then we start to reverse each group of k nodes from the end towards the start.
+     */
     public static class Solution1 {
         public ListNode reverseKGroup(ListNode head, int k) {
             ListNode curr = head;
@@ -44,16 +46,16 @@ public ListNode reverseKGroup(ListNode head, int k) {
             int n = 0; // number of nodes
 
             ListNode curr = head;
-            while(curr != null){
-                n ++;
+            while (curr != null) {
+                n++;
                 curr = curr.next;
             }
 
             ListNode prev = null;
             ListNode next = null;
             ListNode newHead = null;
             ListNode tail1 = null;
-            ListNode tail2 =  head;
+            ListNode tail2 = head;
 
             curr = head;
 
diff --git a/src/test/java/com/fishercoder/_25Test.java b/src/test/java/com/fishercoder/_25Test.java
@@ -28,6 +28,7 @@ public void test1() {
         expected = LinkedListUtils.contructLinkedList(new int[]{2, 1, 4, 3, 5});
         assertEquals(actual, expected);
     }
+
     @Test
     public void test2() {
         head = LinkedListUtils.contructLinkedList(new int[]{1, 2, 3, 4, 5, 6, 7});

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