92. Reverse Linked List II

Problem:

Reverse a linked list from position m to n. Do it in one-pass.

Note: 1 ≤ m ≤ n ≤ length of list.

Example:

Input: 1->2->3->4->5->NULL, m = 2, n = 4
Output: 1->4->3->2->5->NULL

Analysis:

本题的思路是通过链表找到第一个点，然后采用头插发依次插入（n-m）个元素，之后又采用尾插法将剩余的元素插入到新的链表中。代码如下：

Code:

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode reverseBetween(ListNode head, int m, int n) {
        if(head == null || m == n || m > n)
            return head;
        ListNode p = head;
        int cnt = 0;
        ListNode res = new ListNode(-1);
        ListNode pre = res;
        while(p != null) {
            cnt++;
            if(cnt == m) {
                //System.out.println("[msg1]: " + p.val);
                ListNode temp = new ListNode(p.val);
                pre.next = temp;
                ListNode cur = pre;
                pre = pre.next;
                n -= m;
                while(p != null && n > 0) {
                    n--;
                    p = p.next;
                    ListNode ts = new ListNode(p.val);
                    ListNode nxt = cur.next;
                    cur.next = ts;
                    ts.next = nxt;
                }
            } else {
                ListNode temp = new ListNode(p.val);
                pre.next = temp;
                pre = pre.next;
            }
            p = p.next;
        }
        return res.next;
    }
}