[leetcode] Reverse Linked List II

public class Solution {
    public ListNode reverseBetween(ListNode head, int m, int n) {
        ListNode newHead = new ListNode(-1);
        newHead.next = head;
        ListNode p = newHead;
        for (int i = 0; i < m - 1; i++) {
            p = p.next;
        }
        ListNode pre = p;
        ListNode start = p.next;

        for (int i = 0; i < n - m; i++) {
            p = start.next;
            start.next = p.next;
            p.next = pre.next;
            pre.next = p;

        }

        return newHead.next;
    }

    public static void main(String[] args) {
        ListNode head = ListUtils.makeList(new int[] { 1, 2, 3, 4, 5 });
        ListUtils.printList(head);
        head = new Solution().reverseBetween(head, 4, 5);
        ListUtils.printList(head);
    }

}