lc725.分隔链表

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    int get_list_length(ListNode* head){
        int ans = 0;
        while(head){
            ans += 1;
            head = head->next;
        }
        return ans;
    }
    vector<ListNode*> splitListToParts(ListNode* head, int k) {
        int len = get_list_length(head);

        vector<ListNode*> ans(k);

        int base = len / k, offset = len % k;
        ListNode* cur = head;
        
        for(int i = 0; i < k && cur != nullptr; i++){
            ans[i] = cur;
            int target = base;

            if(offset > 0){
                target += 1;
                offset -= 1;
            }            

            for(int j = 1; j < target; j++){
                cur = cur->next;
            }

            ListNode* ne = cur->next;
            cur->next = nullptr;
            cur = ne;
        }

        return ans;
    }
};