题解 | #链表的奇偶重排#
链表的奇偶重排
http://www.nowcoder.com/practice/02bf49ea45cd486daa031614f9bd6fc3
# def __init__(self, x):
# self.val = x
# self.next = None
#
# 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
#
#
# @param head ListNode类
# @return ListNode类
#
class Solution:
def oddEvenList(self , head: ListNode) -> ListNode:
# write code here
if head == None or head.next == None:
return head
ji = head
ou = head.next
temp = ou
while ou and ou.next: #使用ou作为判断条件,不用再考虑ji.next是否为空
ji.next = ji.next.next
ou.next = ou.next.next
ji = ji.next
ou = ou.next
ji.next = temp #不能再使用head.next
return head