给你单链表的头指针 head 和两个整数 left 和 right ,其中 left <= right 。请你反转从位置 left 到位置 right 的链表节点,返回 反转后的链表 。
示例 1:
输入:head = [1,2,3,4,5], left = 2, right = 4
输出:[1,4,3,2,5]
示例 2:
输入:head = [5], left = 1, right = 1
输出:[5]
提示:
链表中节点数目为 n
1 <= n <= 500
-500 <= Node.val <= 500
1 <= left <= right <= n
进阶: 你可以使用一趟扫描完成反转吗?
题解
找到left前继,right和后记,然后对于[left,right]中的区域进行头插法。最后判断pre是否有值。
/**
* 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) {
if(left == right)return head;
int num = 1;
ListNode *pre = NULL,*end = NULL;
ListNode * t = head;
ListNode * a = NULL;
while(num < left){
if(num == left - 1)pre = t;
num ++;
t= t->next;
}
a = t;
ListNode * tt = new ListNode(0,NULL);
while(num <= right){
ListNode * temp = t->next;
t->next = tt->next;
tt->next = t;
t = temp;
num ++;
}
end = t;
a->next = end;
if(pre != NULL)pre->next = tt->next;
else return tt->next;
return head;
}
};