LeetCode-24、两两交换链表中的节点-中等

LeetCode-24、两两交换链表中的节点-中等

给定一个链表，两两交换其中相邻的节点，并返回交换后的链表。

你不能只是单纯的改变节点内部的值，而是需要实际的进行节点交换。

 

示例:

给定 1->2->3->4, 你应该返回 2->1->4->3.

 

代码1：直接解法

# 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:
        res = ListNode(None)
        res.next = head
        point = res
        while point.next and point.next.next:
            m, n = point.next, point.next.next
            point.next = n
            m.next = n.next
            point.next.next = m
            point = point.next.next
        return res.next

 

代码2：递归

# 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 is None or head.next is None:
            return head
        point = head.next
        head.next = self.swapPairs(head.next.next)
        point.next = head
        return point