两两交换链表中的节点
给你一个链表,两两交换其中相邻的节点,并返回交换后链表的头节点。你必须在不修改节点内部的值的情况下完成本题(即,只能进行节点交换)。
示例 1:
输入:head = [1,2,3,4] 输出:[2,1,4,3]
示例 2:
输入:head = [] 输出:[]
示例 3:
输入:head = [1] 输出:[1]
提示:
- 链表中节点的数目在范围
[0, 100]
内 0 <= Node.val <= 100
这道题目用的迭代的方式,就是两两操作next指针,注意的地方就是小心节点丢失造成的死循环。
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def swapPairs(self, head: Optional[ListNode]) -> Optional[ListNode]:
if head == None or head.next == None:return head
res = ListNode
pre_pre = res
res.next = head
pre = head
next = head.next
idx = next.next
while pre!=None and next!=None:
pre_pre.next = next
next.next = pre
pre.next = idx
pre_pre = pre
if idx == None or idx.next==None:break
else:
pre = idx
next = idx.next
idx = next.next
return res.next
看到有人用的递归的方法,但是害怕递归...qwq
——————————————————————————————————————————
ok,还是要面对一下的!回来再补一下递归的代码
class Solution:
def swapPairs(self, head: Optional[ListNode]) -> Optional[ListNode]:
if head == None or head.next == None:return head
a = head
b = head.next
c = b.next
a.next = self.swapPairs(c)
b.next = a
return b