Reverse a linked list from position m to n. Do it in-place and in one-pass.
For example:
Given 1->2->3->4->5->NULL
, m = 2 and n = 4,
return 1->4->3->2->5->NULL
.
Note:
Given m, n satisfy the following condition:
1 ≤ m ≤ n ≤ length of list.
sol:
1.义pre,cur来遍历链表,寻找到第m个节点,start记录了第m个节点。
2.定义inpre,innext,找到第m个节点后使用inpre,cur和innext来遍历m到n之间的节点,cur->next=inpre的方法来reverse链表,当cur为第n个节点时,完成逆转后跳出循环。
3.现在第m个节点是start,第n个节点是inpre(因为在break之前,cnt又走了一步),第n+1个节点是cur,第m-1个节点是pre。需要连起来三段链表:pre->next = inpre; start->next = cur;
code:
class Solution {
public:
ListNode* reverseBetween(ListNode *head,int m,int n)
{
if(m==n) return head;
ListNode *root,*pre,*cur;
pre=new ListNode(0);
root=pre;
pre->next = head;
cur=head;
int index=1;
ListNode *start,*end,*inpre,*innext;
while(cur!=NULL)
{
if(index==m)//找到第m个
{
start = cur;//start是第m个
inpre=cur;
index++;
cur=cur->next;
continue;
}
if(index>m&&index<=n)//cur在m和n之间。顺序是inpre,cur,innnext
{
innext = cur->next;
cur->next = inpre;
inpre=cur;
cur = innext;
if(index==n) break;
index++;
}else//仍在第m个之前,pre最后记录的是第m-1个节点
{
pre = cur;
cur = cur->next;
index++;
}
}
//将三段连起来
pre->next = inpre;
start->next = cur;
return root->next;
}
};