leetcode之Odd Even Linked List

这题一开始没有看懂题意导致浪费了好长时间。这道题是先排列奇数node，后排列偶数node。代码如下：

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

class Solution(object):
    def oddEvenList(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        if not head:
            return head
        if not head.next:
            return head
        n = 2
        RightOdd = head
        LeftEven = head.next
        RightEven = head.next
        head1 = head.next.next
        while head1:
            n = n + 1
            if n % 2 == 0:
                RightEven.next = head1
                RightEven = head1
                head1 = head1.next
            else:
                RightEven.next = head1.next
                RightOdd.next = head1
                head1.next = LeftEven
                RightOdd = head1
                head1 = RightEven.next
        return head