Reverse Linked List II

    public ListNode reverseBetween(ListNode head, int m, int n) {
        // Start typing your Java solution below
        // DO NOT write main() function
        if(head == null || m == n) return head;
        ListNode previous = null;
        if(m == 1) {
            previous = new ListNode(-1);
            previous.next = head;
        }else {
            previous = head;
        }
        ListNode last = head;
        for(int i = 1; i <= n; i++) {
            last = last.next;
        }
        for(int i = 1; i < m - 1; i++) {
            previous = previous.next;
        }
        ListNode current = previous.next;
        while(current.next != last) {
            ListNode tmp = current.next;
            current.next = tmp.next;
            tmp.next = previous.next;
            previous.next = tmp;
        }
        if(m == 1) {
            return previous.next;
        }else {
            return head;
        }
    }