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

部分反转链表，可以增加一个指向链表头的结点来简化代码。

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode reverseBetween(ListNode head, int m, int n) {
        if (head == null || m >= n) {
            return head;
        }
        
        ListNode dummy = new ListNode(0);
        dummy.next = head;
        
        ListNode pre = dummy;
        ListNode first = head;
        for (int i = 1; i < m; i++) {
            pre = pre.next;
            first = first.next;
        }
        
        ListNode curPre = first;
        ListNode cur = first.next;
        
        
        for (int i = m; i < n; i++) {
            ListNode temp = cur.next;
            cur.next = curPre;
            curPre = cur;
            cur = temp;
        }
        
        pre.next = curPre;
        first.next = cur;
        
        return dummy.next;
    }
}