地址:https://leetcode-cn.com/problems/reverse-nodes-in-k-group/
思路:在翻转时,保存连续的三个节点进行翻转,以及注意翻转区间和两端的连接
Code:
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
ListNode* reverseKGroup(ListNode* head, int k) {
if(head==NULL||k==1) return head;
ListNode *p=head,*l,*r,*h1,*h2;
int t=1;
while(p!=NULL&&t<k){
p=p->next;
++t;
}
if(t==k&&p!=NULL){
r=l=head; h1=l->next; h2=h1->next;
head=p; p=p->next; l->next=p;
--t;
while(--t){
h1->next=l;
l=h1; h1=h2; h2=h2->next;
}
h1->next=l;
while(true){
t=1;
p=r; r=r->next;
while(r!=NULL&&t<k){
r=r->next;
++t;
}
if(t==k&&r!=NULL){
l=p->next; h1=l->next; h2=h1->next;
p->next=r; l->next=r->next; r=l;
--t;
while(--t){
h1->next=l;
l=h1; h1=h2; h2=h2->next;
}
h1->next=l;
}else break;
}
}
return head;
}
};
int main()
{
return 0;
}