forked from larissalages/code_problems
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path725.cpp
More file actions
50 lines (49 loc) · 1.15 KB
/
725.cpp
File metadata and controls
50 lines (49 loc) · 1.15 KB
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
50
/**
* 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:
ListNode* getList(ListNode* head,int size){
if(!size) return NULL;
size-=1;
ListNode* headref=head;
while(size){
headref=headref->next;
size--;
}
head=headref->next;
headref->next=NULL;
return head;
}
vector<ListNode*> splitListToParts(ListNode* root, int k) {
int size=0;
auto *head=root;
vector<ListNode *> v;
while(head){
head=head->next;
size+=1;
}
int rem=size%k,len=size/k;
k-=rem;
while(rem){
auto *prev=root;
root=getList(root,len+1);
v.push_back(prev);
rem--;
}
while(k){
auto *prev=root;
root=getList(root,len);
v.push_back(prev);
k--;
}
return v;
}
};