[Leetcode] 24. Swap Nodes in Pairs

本文介绍了一种在常数空间复杂度下交换链表中每两个相邻节点的算法。通过迭代方式实现,每次操作记录前一节点并更新指针指向,最终返回修改后的链表头。该方法不改变节点值,仅调整节点位置。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Problem:

Given a linked list, swap every two adjacent nodes and return its head.
For example,
Given 1->2->3->4, you should return the list as 2->1->4->3.
Your algorithm should use only constant space. You may not modify the values in the list, only nodes itself can be changed.

Idea:
Just do swap operation every two nodes. Therefore, after every swap operation, we need to move tmpNode backwards by two Nodes. Kindly note that the previous node should be recorded for the following swap operation.

Solution:

class Solution(object):
    def swapPairs(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        preheadNode = ListNode(-1)
        preheadNode.next = head
        tmpNode = None if head == None else head.next
        preNode = preheadNode
        while tmpNode != None:
            nextNode = tmpNode.next
            tmpNode.next = preNode.next
            preNode.next.next = nextNode
            preNode.next = tmpNode
            preNode = tmpNode.next
            tmpNode = None if nextNode == None else nextNode.next
        return preheadNode.next
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值