Reverse Linked List II

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.

相当于部分区域旋转

/**
 * 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 == NULL)
            return NULL;
            
       ListNode* Head=new ListNode(NULL);
       Head->next=head;
       ListNode* pre=Head;
       for(int i=0;i<m-1;i++)
       pre=pre->next;
       //找到第一个平移的节点，移动
       ListNode* head2=pre;
       pre=pre->next;
       ListNode* cur=pre->next;
       //平移一个一个节点
       for(int i=m;i<n;i++)
       {
           pre->next=cur->next;
           cur->next=head2->next;
           head2->next=cur;
           cur=pre->next;
           
       }
       return Head->next;
    }
};