[LeetCode] 92. Reverse Linked List II

[LeetCode] 92. 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.

---

思路：直接模拟，自己手动画一下呗。

---

class Solution {
public:
    ListNode* reverseBetween(ListNode* head, int m, int n) {
        if (m == n) return head;
        int cnt = 0;
        ListNode* tmp = new ListNode(-1);
        tmp->next = head;
        ListNode* pre=tmp;
        ListNode* now=NULL;
        ListNode* nex=NULL;
        ListNode* p = tmp;
        now = head;
        nex = now->next;
        while (cnt < m) {
            tmp = pre;
            pre = now;
            now = nex;
            nex = nex->next;
            ++cnt;
        }
        while (cnt < n) {
            now->next = pre;
            pre = now;
            now = nex;
            if (nex != NULL) nex = nex->next;
            ++cnt;
        }

        tmp->next->next = now;
        tmp->next = pre;

        return p->next;
    }
};