- LeetCode 61. 旋转链表(Medium)/ 234. 回文链表(Easy)/ 148. 排序链表(Medium)/ 143. 重排链表(Medium)/ 328. 奇偶链表(Medium)
- 题解
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
# 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
#
# @param head ListNode类
# @return ListNode类
#
class Solution:
def oddEvenList(self , head ):
# write code here
if not head: return head
odd = head
even = head.next
even_head = even # 先暂存偶链表的头节点
while even and even.next:
odd.next = even.next # 奇指向偶所指向的
odd = odd.next # 奇后移一位
even.next = odd.next # 偶指向奇所指向的
even = even.next # 偶后移一位
odd.next = even_head # 最后让奇链表指向偶链表
return head