Reverse a linked list from position m to n. Do it in one-pass.
Note: 1 ≤ m ≤ n ≤ length of list.
Example:
Input: 1->2->3->4->5->NULL, m = 2, n = 4
Output: 1->4->3->2->5->NULL
思路:(与单链表的反转有什么不同?)将cur->next这个点先删除再插入到cur的前面和pre的后面;
1、反转m--n;那么需要遍历;0---m不反转;pre=pre->next;cur=cur->next;
2、m----n反转;进行多次循环每次循环将cur后面的值挪到pre之后;这样就反转了
1->2->3->4
pre 1
cur 2
pNext 3;
pNext->next 4;
ListNode *pNext=cur->next;
cur->next=pNext->next;
pNext->next=pre->next;
pre->next=pNext;
这样 就变成了1->3->2->4;
Code:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* reverseBetween(ListNode* head, int m, int n)
{
if(head==nullptr||m>n)
return nullptr;
ListNode *dummy=new ListNode (0);
dummy->next=head;
ListNode *cur=head;
ListNode *pre=dummy;
for(int i=1;i<m;i++)//从0--m不反转;
{
pre=pre->next;
cur=cur->next;
}
for(int i=m;i<n;i++)//从m-n进行翻转;相当于 将pNext这个值先删除 然后再插入到 pre和cur之间;
{
ListNode *pNext=cur->next;
cur->next=pNext->next;
pNext->next=re->next;
pre->next=pNext;
}
return dummy->next;
}
};