LeetCode 练习题14
两两交换链表中的节点
题目描述
给定一个链表,两两交换其中相邻的节点,并返回交换后的链表。
你不能只是单纯的改变节点内部的值,而是需要实际的进行节点交换。
示例:
给定 1->2->3->4, 你应该返回 2->1->4->3.
解题方法
方法一:
两两交换,递归方法
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def swapPairs(self, head: ListNode) -> ListNode:
if head : next0 = head
else: return
if head.next: next1 = head.next
else: return head
next2 = head.next.next
next0.next = None
next1.next = next0
res = next1
next1 = next1.next
if next2 and next2.next: next1.next = self.swapPairs(next2)
elif next2 and not next2.next: next1.next = next2
return res
方法二:
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def swapPairs(self, head: ListNode) -> ListNode:
if not head or not head.next:
return head
next = head.next
head.next = self.swapPairs(next.next)
next.next = head
return next