题目链接:https://leetcode-cn.com/problems/reverse-linked-list-ii/
题目如下:
思路:
/**
* 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:
ListNode* reverseBetween(ListNode* head, int left, int right) {
ListNode* dummyHead=new ListNode(-1);
dummyHead->next=head;
auto pre=dummyHead,cur=dummyHead->next;
for(int i=0;i<left-1;i++){
pre=cur;
cur=cur->next;
}
auto a=pre,b=cur;//保存住,作为之后使用
for(int i=left;i<=right;i++){
auto temp=cur->next;
cur->next=pre;
pre=cur;cur=temp;
}
b->next=cur;
a->next=pre;
ListNode* result=dummyHead->next;
delete dummyHead;
return result;
/*
ListNode* cur=head;
ListNode* pre=NULL;
for(int i=0;i<left-1;i++){
pre=cur;
cur=cur->next;
}
auto a=pre,b=pre->next;//当left为1时头节点会发生变化,故此,需增加一个dummy节点
for(int i=left;i<=right;i++){
ListNode* temp=cur->next;
cur->next=pre;
pre=cur;cur=temp;
}
b->next=cur;
a->next=pre;
return head;
*/
}
};