奇偶链表

题目:

https://leetcode-cn.com/problems/odd-even-linked-list/

代码：

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

class Solution:
    def oddEvenList(self, head: ListNode) -> ListNode:
        if head == None or head.next == None:
            return head

        odd = head
        even = head.next
        evenhead = even
        while odd.next or  even.next:
            if even.next:
                odd.next = even.next
                odd = odd.next
            else:
                odd.next = None
            if odd.next:
                even.next =odd.next
                even = even.next
            else:
                even.next = None
            
        odd.next = evenhead
        return head

思路：

https://leetcode-cn.com/problems/odd-even-linked-list/solution/qi-ou-lian-biao-by-leetcode/

注意：拆分一个链表 并没有生成新的空间。注意链表的数据结构特点。