分割链表，将链表分割成k份

Given a (singly) linked list with head node root, write a function to split the linked list into k consecutive linked list "parts".

The length of each part should be as equal as possible: no two parts should have a size differing by more than 1. This may lead to some parts being null.

The parts should be in order of occurrence in the input list, and parts occurring earlier should always have a size greater than or equal parts occurring later.

Return a List of ListNode's representing the linked list parts that are formed.

Examples 1->2->3->4, k = 5 // 5 equal parts [ [1], [2], [3], [4], null ]

Example 1:

Input: 
root = [1, 2, 3], k = 5
Output: [[1],[2],[3],[],[]]
Explanation:
The input and each element of the output are ListNodes, not arrays.
For example, the input root has root.val = 1, root.next.val = 2, \root.next.next.val = 3, and root.next.next.next = null.
The first element output[0] has output[0].val = 1, output[0].next = null.
The last element output[4] is null, but it's string representation as a ListNode is [].

 

Example 2:

Input: 
root = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], k = 3
Output: [[1, 2, 3, 4], [5, 6, 7], [8, 9, 10]]
Explanation:
The input has been split into consecutive parts with size difference at most 1, and earlier parts are a larger size than the later parts.

 

Note:

• The length of root will be in the range [0, 1000].
• Each value of a node in the input will be an integer in the range [0, 999].
• k will be an integer in the range [1, 50].

大致意思就是，给定一个链表，和数字k，将链表分割成k份，如果链表节点个数不够分成k份，不够的部分用null填充。如果不能被k整除，那么排在前面的分割部分平摊不够整除的部分。举个例子root = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], k = 4，那么分割完应该是[[1, 2, 3], [4, 5, 6], [7, 8],[9, 10]]

思路很简单，如果链表长度n，分割成k份，平均每份最少n/k份，如果有多余部分，多余部分是r=n%k个，在遍历的时候前r个部分多分一个节点即可。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    vector<ListNode*> splitListToParts(ListNode* root, int k) {
        vector<ListNode *> result;
        
        int len = 0;
        for(ListNode * p = root; p != NULL; ++len, p = p->next);
        int step = len / k, rest = len % k;
        if (len < k) {
            step = 1;
            rest = 0;
        }
        
        ListNode * head = root;
        ListNode s(0), *p = &s;
        s.next = head;
        
        for (int i = 0; i < k; ++i) {
            ListNode * tail = p;
            int more = rest > 0 ? 1 : 0;
            for(int j = 0; j < step + more; ++j) {
                 if (tail != NULL) {
                     tail = tail->next;
                 }
            }
            if (tail != NULL) {
                ListNode * next = tail->next;
                tail->next = NULL;
                result.push_back(p->next);
                p->next = next;
            } else {
                result.push_back(p->next);
                p->next = NULL;
            }
            rest -= 1;
        }
        return result;
    }
};