给你单链表的头指针 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=1&&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(left==1&&right==1) return head;
if(left!=1) {
head->next= reverseBetween(head->next,left-1,right-1);
} else{
struct ListNode *tail=head->next,*new_head;
new_head= reverseBetween(head->next,left,right-1);
head->next=tail->next;
tail->next=head;
head=new_head;
}
return head;
}