Reverse Linked List II 2020-09-14 06:20

Problem Description

public ListNode reverseBetween(ListNode head, int m, int n) {
    ListNode fake = new ListNode(0);
    fake.next = head;
    ListNode pre = fake;
    for (int i = 0; i < m-1; i++) {
        pre = pre.next;
    }
    ListNode next;
    ListNode current = pre.next;
    for (int i = m; i < n; i++) {
        next = current.next;
        current.next=next.next;
        next.next=pre.next;
        pre.next=next;
    }
    return fake.next;
}
Runtime Memory
0 ms 36.8 MB

henryxi leetcode list

EOF