725. Split Linked List in Parts

最新推荐文章于 2024-05-21 23:23:46 发布

转载最新推荐文章于 2024-05-21 23:23:46 发布 · 144 阅读

本文介绍了一种将单链表平均分成k个连续子链表的算法实现。该算法确保了每个子链表长度尽可能相等，且相邻部分大小差不超过1。通过实例展示了输入输出的转换过程及具体步骤。

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].

/**
 * 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) {
        int len = 0;
        ListNode * tmp = root;
        while(tmp!=NULL)
        {
            len+=1;
            tmp = tmp->next;
        }
        int m = len/k, n = len%k;
        int first = m + (n==0?0:1);
        vector<ListNode *> res(k, NULL);
        
        tmp = root;
        for(int i=1; i<=k; i++)
        {
            res[i-1] = tmp;
            int j=1;
            m = i<=n ? first : len/k;
            for(;j<m&&tmp&&tmp->next;j++)
            {
                tmp=tmp->next;
            }
            if(!tmp || !tmp->next)
                break;
            ListNode *t = tmp->next;
            tmp->next = NULL;
            tmp = t;
        }
        return res;
    }
};