reverse-linked-list-ii

中等 翻转链表 II

29%

通过

翻转链表中第m个节点到第n个节点的部分

您在真实的面试中是否遇到过这个题？ 

Yes

样例

给出链表1->2->3->4->5->null， m = 2 和n = 4，返回1->4->3->2->5->null

注意

m，n满足1 ≤ m ≤ n ≤ 链表长度

package test.reverse;
import test.reverse.ListNode;

public class Solution {
    /**
     * @param ListNode head is the head of the linked list 
     * @oaram m and n
     * @return: The head of the reversed ListNode
     */
     public ListNode reverseBetween(ListNode head, int m, int n) {
        if (m >= n || head == null) {
            return head;
        }
        
        ListNode dummy = new ListNode(0);
        dummy.next = head;
        head = dummy;
        
        for (int i = 1; i < m; i++) {
            if (head == null) {
                return null;
            }
            head = head.next;
        }
        
        ListNode premNode = head;
        ListNode mNode = head.next;
        ListNode nNode = mNode, postnNode = mNode.next;
        for (int i = m; i < n; i++) {
            if (postnNode == null) {
                return null;
            }
            ListNode temp = postnNode.next;
            postnNode.next = nNode;
            nNode = postnNode;
            postnNode = temp;
        }
        mNode.next = postnNode;
        premNode.next = nNode;
        
        return dummy.next;
    }
     public static void main(String[] args) {
		ListNode node1 = new ListNode(1);
		ListNode node2 = new ListNode(2);
		ListNode node3 = new ListNode(3);
		ListNode node4 = new ListNode(4);
		ListNode node5 = new ListNode(5);
		node1.next = node2;
		node2.next = node3;
		node3.next = node4;
		node4.next = node5;
		Solution solution = new Solution();
		ListNode newHead = solution.reverseBetween(node1, 2, 4);
		/*while(newHead!=null){
			System.out.println(newHead.val);
			newHead = newHead.next;
		}*/
	}
}