solve problem Split Linked List In Parts

Author: P-ppc

README.md

@@ -269,6 +269,7 @@ All solutions will be accepted!
 |150|[Evaluate Reverse Polish Notation](https://leetcode-cn.com/problems/evaluate-reverse-polish-notation/description/)|[java/py/js](./algorithms/EvaluateReversePolishNotation)|Medium|
 |341|[Flatten Nested List Iterator](https://leetcode-cn.com/problems/flatten-nested-list-iterator/description/)|[java/py/js](./algorithms/FlattenNestedListIterator)|Medium|
 |856|[Score Of Parentheses](https://leetcode-cn.com/problems/score-of-parentheses/description/)|[java/py/js](./algorithms/ScoreOfParentheses)|Medium|
+|725|[Split Linked List In Parts](https://leetcode-cn.com/problems/split-linked-list-in-parts/description/)|[java/py/js](./algorithms/SplitLinkedListInParts)|Medium|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/SplitLinkedListInParts/README.md

@@ -0,0 +1,2 @@
+# Split Linked List In Parts
+This problem is easy to solve

algorithms/SplitLinkedListInParts/Solution.java

@@ -0,0 +1,48 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+    public ListNode[] splitListToParts(ListNode root, int k) {
+        ListNode[] res = new ListNode[k];
+        int length = 0;
+        ListNode p = root,
+                 pre = root;
+        
+        while (p != null) {
+            p = p.next;
+            length++;
+        }
+        
+        int quotient = length / k,
+            remainder = length % k;
+        
+        p = root;
+        
+        int i = 0,
+            j = 0;
+        
+        while (p != null) {
+            if (i++ == 0)
+                res[j++] = p;
+            
+            pre = p;
+            p = p.next;
+            
+            if (remainder > 0 && i == quotient + 1) {
+                remainder--;
+                pre.next = null;
+                i = 0;
+            } else if (remainder == 0 && i == quotient) {
+                pre.next = null;
+                i = 0;
+            }
+        }
+        
+        return res;
+    }
+}

algorithms/SplitLinkedListInParts/solution.js

@@ -0,0 +1,51 @@
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val) {
+ *     this.val = val;
+ *     this.next = null;
+ * }
+ */
+/**
+ * @param {ListNode} root
+ * @param {number} k
+ * @return {ListNode[]}
+ */
+var splitListToParts = function(root, k) {
+    let res = [],
+        length = 0,
+        p = root
+    
+    while (p) {
+        p = p.next
+        length++
+    }
+    
+    let quotient = parseInt(length / k),
+        remainder = length % k
+    
+    p = root
+    let pre = p,
+        i = 0
+    
+    while (p) {
+        if (i++ == 0)
+            res.push(p)
+        
+        pre = p
+        p = p.next
+        
+        if (remainder > 0 && i == quotient + 1) {
+            remainder--
+            pre.next = null
+            i = 0
+        } else if (remainder == 0 && i == quotient) {
+            pre.next = null
+            i = 0
+        }
+    }
+    
+    while (res.length < k)
+        res.push(null)
+    
+    return res
+};

algorithms/SplitLinkedListInParts/solution.py

@@ -0,0 +1,48 @@
+# Definition for singly-linked list.
+# class ListNode(object):
+#     def __init__(self, x):
+#         self.val = x
+#         self.next = None
+
+class Solution(object):
+    def splitListToParts(self, root, k):
+        """
+        :type root: ListNode
+        :type k: int
+        :rtype: List[ListNode]
+        """
+        res = []
+        length = 0
+        p = root
+    
+        while p:
+            p = p.next
+            length += 1
+        
+        quotient = length / k
+        remainder = length % k
+        
+        p = root
+        pre = p
+        i = 0
+        
+        while p:
+            if i == 0:
+                res.append(p)
+                
+            i += 1
+            pre = p
+            p = p.next
+            
+            if remainder > 0 and i == quotient + 1:
+                remainder -= 1
+                pre.next = None
+                i = 0
+            elif remainder == 0 and i == quotient:
+                pre.next = None
+                i = 0
+        
+        while len(res) < k:
+            res.append(None)
+        
+        return res