Leetcode: Reverse Linked List I

Reverse Linked List II

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

For example:
Given 1->2->3->4->5->NULL, m = 2 and n = 4,

return 1->4->3->2->5->NULL.

Note:
Given m, n satisfy the following condition:
1 ≤ m ≤ n ≤ length of list.

解析：定位m点与n点，然后反转两点之间的链表。注意m点与n点为头节点或尾节点的情况，处理好边界即可。

代码：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode reverseBetween(ListNode head, int m, int n) {
        
        if(head==null||head.next==null||m==n)return head;
        
        ListNode dummy = new ListNode(0);
        dummy.next = head;
        
        ListNode M = dummy;
        ListNode N = dummy;
        
        for(int i=1;i<m;i++)
            M = M.next;
        for(int i=1;i<n;i++)
            N = N.next;
        
        ListNode t = M.next;
        ListNode h = N.next;
        ListNode curr = t.next;
        
        t.next = h.next;
        M.next = h;
        
        while(curr!=h)
        {
            ListNode tmp = curr.next;
            curr.next = t;
            t = curr;
            curr = tmp;
        }
        
        h.next = N;
        
        return dummy.next;
    }
}