LeetCode | 725. Split Linked List in Parts

.

题目

Given the head of a singly linked list and an integer k, 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 one. This may lead to some parts being null.

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

Return an array of the k parts.

Example 1:

Input: head = [1,2,3], k = 5
Output: [[1],[2],[3],[],[]]

Explanation:

The first element output[0] has output[0].val = 1, output[0].next = null.
The last element output[4] is null, but its string representation as a ListNode is [].

Example 2:

Input: head = [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.

Constraints:

• The number of nodes in the list is in the range [0, 1000].
• 0 <= Node.val <= 1000
• 1 <= k <= 50

.

代码

/**
 * 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*> res;
        int numNode = 0;
        for(ListNode* p = root; p != NULL; )
        {
            numNode++;
            p = p->next;
        }
        int a = numNode / k, b = numNode % k, curNum;
        ListNode* p = root;
        for(int i = 0; i<k; i++)
        {
            if(b)
            {
                curNum = a + 1;
                b--;
            }
            else
                curNum = a;
            ListNode* curRoot = p, *pre;
            for(int j = 0; p != NULL && j < curNum; j++)
            {
                pre = p;
                p = p->next;
                if(j == curNum - 1)
                    pre->next = NULL;
            }
            res.push_back(curRoot);
        }
        
        return res;
    }
};

.