24. 两两交换链表中的节点

longying1999

已于 2023-03-25 22:48:27 修改

阅读量30

点赞数

文章标签：链表数据结构

于 2023-03-25 21:01:56 首次发布

本文链接：https://blog.csdn.net/longying1999/article/details/129772314

版权

题目描述

方法;

1. 迭代 pre->head->ne

# 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 not head or not head.next:
            return head

        pre= dump = ListNode(0)
        pre.next = head
        ne = head.next
        
        while ne:
            tmp = ne.next
            ne.next = head
            head.next = tmp
            pre.next = ne
            ne = head.next
            pre =pre.next

            if ne:
                ne = ne.next
                head = head.next
                pre= pre.next

        return dump.next

时间复杂度：O(n)，空间复杂度：O(1)

2. 递归

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

时间复杂度：O(n)，空间复杂度：O(n)