原题目:https://leetcode-cn.com/problems/reverse-nodes-in-k-group/
思路:
找出长度为k的子链表,用pre表示head的上一个节点,nex表示tail的下一个节点,对子链表进行翻转,然后在重新连接到pre个nex之间。这样就完成了一次的翻转,变换之后,保持pre是head的上一个节点,则prev=tail,head=tail->next,
子链表的翻转:采用尾插法
代码:
class Solution {
public:
//翻转子链表
pair<ListNode*,ListNode*>reverse(ListNode* head, ListNode* tail){
ListNode* prev = tail->next;
ListNode* p = head;
while(prev != tail){
ListNode* nex = p->next;
p->next = prev;
prev=p;
p = nex;
}
return {tail,head};
}
ListNode* reverseKGroup(ListNode* head, int k) {
ListNode* hair = new ListNode(0);//构造链表的头结点
hair->next = head;
ListNode* pre=hair;
while(head){
ListNode* tail = pre;
for(int i=0;i<k;i++){
tail = tail->next;
if(!tail) return hair->next;
}
ListNode* nex = tail->next;
tie(head,tail) = reverse(head,tail);
pre->next=head;
tail->next = nex;
pre = tail;
head = nex;
}
return hair->next;
}
};