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.

解题思路：

此题是对http://blog.csdn.net/u010455041/article/details/46472369的参考。可以考虑对其中的reverseList函数进行更改，增加一个tail做哨兵使用。

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None


class Solution:
    # @param {ListNode} head
    # @param {integer} m
    # @param {integer} n
    # @return {ListNode}
    def reverseBetween(self, head, m, n):
        def reverseList(head,tail):
            sentry = ListNode(-1)
            sentry.next = tail
            while head!=tail:
                tmp = head
                head = head.next
                tmp.next = sentry.next
                sentry.next = tmp
            return sentry.next
            


        sentry = ListNode(-1)
        sentry.next = head
        p1,p2,tmp = sentry,sentry,sentry
        i = 0
        while i<=n:
            if i==m-1:p1=tmp
            if i==n:p2=tmp
            i += 1
            tmp = tmp.next
        p1.next = reverseList(p1.next,p2.next)
        return sentry.next