[leetcode] 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.

思路：画个图就好理解了，主要是处理next指向问题

代码：

/**
 * 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 *pre=head,*first=NULL;
        for(int i=0;i<m-1;i++){
            first=pre;
            pre=pre->next;
        }
        ListNode *end=pre;
        ListNode *ppre=pre;
        pre=pre->next;
        ListNode *temp;
        for(int i=m+1;i<=n;i++){
            temp=pre->next;
            pre->next=ppre;
            ppre=pre;
            pre=temp;
        }
        end->next=pre;
        if(first!=NULL){
            first->next=ppre;
        }
        else
            head=ppre;
        return head;
    }
};