给定一个链表,两两交换其中相邻的节点,并返回交换后的链表。
你不能只是单纯的改变节点内部的值,而是需要实际的进行节点交换。
示例 1:
输入:head = [1,2,3,4]
输出:[2,1,4,3]
示例 2:
输入:head = []
输出:[]
示例 3:
输入:head = [1]
输出:[1]
提示:
链表中节点的数目在范围 [0, 100] 内
0 <= Node.val <= 100
思路:模拟
暴力写就行了
# 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: ListNode) -> ListNode:
if not head:
return head
ans = head.next
if head.next!=None:
h2 = head.next
head.next = head.next.next
h2.next = head
else:
return head
while head.next:
if head.next.next!=None:
h1 = head.next
h2 = head.next.next
h1.next = h2.next
head.next = h2
head = head.next
head.next = h1
head = head.next
else:
break
return ans