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) {
		// Start typing your Java solution below
		// DO NOT write main() function
		if(head == null)
			return head;
		int dis = n - m;
		if(dis == 0)
			return head;
		ListNode res = new ListNode(0);
		res.next = head;
		ListNode pre = res;
		ListNode cur = head;
		while(m > 1){
			pre = cur;
			cur = cur.next;
			m--;
		}
		ListNode next = cur.next;
		while(next != null && dis > 0){
			cur.next = next.next;
			next.next = pre.next;
			pre.next = next;
			dis--;
			next = cur.next;
		}
		return res.next;
	}
}