链表翻转。给出一个链表和一个数k,比如链表1→2→3→4→5→6,k=2,翻转后2→1→4→3→6→5,若k=3,翻转后3→2→1→6→5→4,若k=4,翻转后4→3→2→1→5→6,用程序实现Node* RotateList(Node* list, size_t k). 提示:这个题是链表逆置的升级变型。
首先理解题意,即将链表分段逆置,每段k个结点,不够k个不逆置
pNode* RotateList(pNode* list, size_t k)
{
assert(list);
pNode pNewEnd = *list;
pNode pCur = NULL;
pNode pPre = NULL;
int count = k;
pNode checkNode = *list;//检测剩下的结点是否够k个;
while (count--) //不够一组直接返回头指针
{
if(!checkNode)
return list;
checkNode = checkNode->next;
}
count = k;
pCur = *list;
while (pCur->next != NULL && count-->1) //将一段链表逆置
{
*list = pCur->next;
pCur->next = pPre;
pPre = pCur;
pCur = *list;
}
pNewEnd->next = *RotateList(&((*list)->next), k);//将这个组连接到下一组
pCur->next = pPre;
return list;
}