思路
直接模拟这个过程
首先统计链表长度n,如果长度小于k,说明前面n个都是单节点,后面k-n个是nullptr;
如果长度大于k,说明每段长度为small = n/k,因为要求长度不超过1,所以有n%k段长度为small+1;
依次添加即可,注意细节。
代码
/**
* 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:
vector<ListNode*> splitListToParts(ListNode* head, int k) {
int n = 0;
ListNode* tmp = head;
while(tmp != nullptr) {
n++;
tmp = tmp->next;
}
vector<ListNode*> ans;
tmp = head;
if(n <= k) { //各一个,后面null
while(tmp != nullptr) {
ListNode* t = tmp;
tmp = tmp->next;
t->next = nullptr;
ans.push_back(t);
}
int last = k - n;
while(last--) ans.push_back(nullptr);
}
else {
int small = n / k;
int bignum = n % k;
for(int i = 0; i < bignum; i++) {
ListNode* t = tmp;
ans.push_back(t);
for(int j = 0; j < small; j++) {
t = t->next;
}
tmp = t->next;
t->next = nullptr;
}
while(tmp != nullptr) {
ListNode* t = tmp;
ans.push_back(t);
for(int j = 0; j < small - 1; j++) {
t = t->next;
}
tmp = t->next;
t->next = nullptr;
}
}
return ans;
}
};