/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
/**
* Return an array of size *returnSize.
* Note: The returned array must be malloced, assume caller calls free().
*/
struct ListNode* splitList(struct ListNode* root, int size);
struct ListNode** splitListToParts(struct ListNode* root, int k, int* returnSize) {
*returnSize = k;
struct ListNode** returnArray;
returnArray= (struct ListNode**)malloc(sizeof(struct ListNode*) * (*returnSize)); //这里需要好好注意,我们并未开辟新的链表,只是开辟了一个链表节点地址的空间
struct ListNode* temp;
int listSize = getSize(root); //取长度
int basicSize = listSize / k; // 11个节点分3节,那么每节基础长度为11/3 = 3;
int sizePlusOne = basicSize + 1;// 3+1=4 较长的长度
int numOfSizePO = listSize % k; //有多少个较长的个数
int i,j;
/****导入较长的链表*****/
for(i = 0; i < numOfSizePO; i++)
{
returnArray[i] = root;
for(j=0; j < sizePlusOne-1; j++)
{
root = root->next;
}
temp = root;
root = root->next;
temp->next = NULL;
}
/*****导入较短的链表*****/
for(i = numOfSizePO; i < k; i++)
{
returnArray[i] = root;
for(j=0; j < basicSize-1; j++)
{
root = root->next;
}
if(root) //这里需要避免的情况是较短的链表为0;
{
temp = root;
root = root->next;
temp->next = NULL;
}
}
return returnArray;
}
int
getSize(
struct ListNode* root)
{
if(!root)
{
return
0;
}
struct ListNode* temp = root;
int count =
1;
while(root->
next)
{
count++;
root = root->
next;
}
return count;
}