[N-0] refactor 725

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_725.java

@@ -75,4 +75,36 @@ private int getLength(ListNode root) {
             return len;
         }
     }
+
+    public static class Solution2 {
+        /**More concise version*/
+        public ListNode[] splitListToParts(ListNode root, int k) {
+            int len = getLength(root);
+            int aveSize = len / k;
+            int extra = len % k;
+            ListNode[] result = new ListNode[k];
+            ListNode prev = null;
+            for (int i = 0; i < k; i++, extra--) {
+                result[i] = root;
+                for (int j = 0; j < aveSize + (extra > 0 ? 1 : 0); j++) {
+                    prev = root;
+                    root = root.next;
+                }
+                if (prev != null) {
+                    prev.next = null;
+                }
+            }
+            return result;
+        }
+
+        private int getLength(ListNode root) {
+            int len = 0;
+            ListNode tmp = root;
+            while (tmp != null) {
+                len++;
+                tmp = tmp.next;
+            }
+            return len;
+        }
+    }
 }

src/test/java/com/fishercoder/_725Test.java

@@ -8,13 +8,15 @@
 
 public class _725Test {
     private static _725.Solution1 solution1;
+    private static _725.Solution2 solution2;
     private static ListNode root;
     private static int k;
     private static ListNode[] actual;
 
     @BeforeClass
     public static void setup() {
         solution1 = new _725.Solution1();
+        solution2 = new _725.Solution2();
     }
 
     @Test
@@ -37,4 +39,24 @@ public void test2() {
         }
     }
 
+    @Test
+    public void test3() {
+        root = LinkedListUtils.contructLinkedList(new int[]{1, 2, 3});
+        k = 5;
+        actual = solution2.splitListToParts(root, k);
+        for (ListNode head : actual) {
+            ListNode.printList(head);
+        }
+    }
+
+    @Test
+    public void test4() {
+        root = LinkedListUtils.contructLinkedList(new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9, 10});
+        k = 3;
+        actual = solution2.splitListToParts(root, k);
+        for (ListNode head : actual) {
+            ListNode.printList(head);
+        }
+    }
+
 }