leetcode_c++：链表：Reverse Linked List II (092)

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.

---

O(n)

---

class Solution {
public:
    ListNode* reverseBetween(ListNode* head, int m, int n) {
        ListNode* mhead=new ListNode(-1),*prev,*cur;
        mhead->next=head;
        for(int i=0;i<m-1;i++)
            mhead=mhead->next;
        prev=mhead->next;
        cur=prev->next;

        for(int i=m;i<n;i++){
            prev->next=cur->next;
            cur->next=mhead->next;
            mhead->next=cur;
            cur=prev->next;
        }

        return m==1? mhead->next:head;
    }
};