算法通关村第二关---反转链表 II

算法通关村第二关—反转链表 II

源码地址：GitHub-算法通关村

题目地址：LeetCode

解题思路：

/**
     * 带虚拟头结点指定区间反转链表
     *
     * @param head
     * @param left
     * @param right
     * @return
     */
    public ListNode reverseBetween(ListNode head, int left, int right) {
        ListNode dummyHead = new ListNode(-1);
        dummyHead.next = head;
        ListNode pre = dummyHead;
        
        for (int i = 0; i < left - 1; i++) {
            pre = pre.next;
        }
        
        ListNode cur = pre.next;
        for (int i = 0; i < right - left; i++) {
            ListNode next = cur.next;
            cur.next = next.next;
            next.next = pre.next;
            pre.next = next;
        }
        
        return dummyHead.next;
    }