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->nullptr, m = 2 and n = 4,
return 1->4->3->2->5->nullptr.
Note: Given m, n satisfy the following condition: 1≤m≤n≤ length of list.
分析
链表翻转的变体，需要判断更多的边界条件。
难度：
Medium

public class Solution {
    public ListNode reverseBetween(ListNode head, int m, int n) {
        ListNode dummy = new ListNode(-1);//使用头结点，天然排除点 m==1 时的某些边界条件判断。
        dummy.next = head;

        ListNode prev = dummy;
        //找到开始翻转之前的前一个节点。
        for (int i = 0; i < m-1; ++i)
            prev = prev.next;
        ListNode head2 = prev;

        prev = head2.next;
        ListNode cur = prev.next;
        for (int i = m; i < n; ++i) {//常规头插法实现链表翻转
            prev.next = cur.next;
            cur.next = head2.next;
            head2.next = cur;  // 头插法
            cur = prev.next;
        }

        return dummy.next;
    }
};