题目
给你单链表的头指针
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
思路
首先对给定的参数进行判断,若不满足 1 <= left <= right <= n
则直接返回头节点。
要反转 left 到 right之间的节点,则我们需要获取到第 left - 1 和 right + 1 个节点,然后对left 到 right之间的节点进行反转,第left - 1 个节点的next指针指向反转后的头部,反转后的最后一个节点的next指针指向right + 1完成反转操作。需要注意,这里涉及到可以有更换新的头节点问题。
代码
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* reverseBetween(struct ListNode* head, int left, int right){
if(head == NULL || head->next == NULL || right <= left){
return head;
}
struct ListNode newHead;
newHead.next = head;
struct ListNode* pre = &newHead;
struct ListNode* end = NULL;
struct ListNode* cur = head;
struct ListNode* tail = NULL,*tmp = NULL;
int len = 0;
while(cur != NULL){
len++;
pre = len == left - 1 ? cur : pre;
end = len == right + 1 ? cur : end;
cur = cur->next;
}
tail = pre->next;
cur = tail->next;
tail->next = end;
while(cur != end){
tmp = cur->next;
cur->next = pre->next;
pre->next = cur;
cur = tmp;
}
return newHead.next;
}