class Solution(object):
"""
存留头节点的问题return new = head??
此处返回self.next
保证链表不断,记录下前节点pre,然后交换当前节点和下一个节点
"""
def swapPairs(self, head):
"""
:type head: ListNode
:rtype: ListNode
"""
pre, pre.next = self, head
while pre.next and pre.next.next:
cur = pre.next
nex = cur.next
pre.next, cur.next, nex.next = nex, nex.next, cur
pre = cur
return self.next
def swapPairs(self, head):
"""
:type head: ListNode
:rtype: ListNode
r如果缺少head.next = head
报错(solution object has no attribute next)
"""
pre,pre.next = self.head
while head and head.next:
cur = head.next
head = head.next
cur.next = head.next
pre.next = head
head.next = cur
pre = cur
head = pre.next
return self.next
【Leetcode】链表题II【python】
最新推荐文章于 2022-01-13 19:22:16 发布