Method reverse

leetcode/143. Reorder List.py:37–45

(self, head)

        return head, middle
    # reverse the behind half linkedlist
    def reverse(self, head):
        reHead = None
        curNode = head
        while curNode:
            nextNode = curNode.next
            curNode.next = reHead
            reHead = curNode
            curNode = nextNode
        return reHead
    # merge the two linkedlist to one
    def reConnect(self, first, second):
        head = first