19. 删除链表的倒数第 N 个结点

最新推荐文章于 2024-09-16 17:05:22 发布

longying1999

最新推荐文章于 2024-09-16 17:05:22 发布

阅读量35

点赞数

文章标签： leetcode

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

版权

文章描述了一种使用快慢指针遍历链表的方法，结合删除操作，来移除链表中倒数第n个节点。在Python中，定义了ListNode类表示单链表节点，并在Solution类中实现removeNthFromEnd函数。该函数首先初始化快慢指针和辅助节点，然后遍历链表直到找到要删除的节点，最后更新链表结构。特别地，处理删除头节点的情况，通过引入dump节点来保持正确连接。

摘要由CSDN通过智能技术生成

题目描述

方法：

1. 快慢指针遍历+删除

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:
        slow = fast = head
        while n>0:
            fast = fast.next
            n -= 1 
        pre = ListNode(0)
        pre.next = slow
        
        while fast:
            fast = fast.next
            slow = slow.next
            pre = pre.next
        pre.next = slow.next

        return head if slow != head else pre.next

注意：判断slow！=head不够优雅

2. 用新的dump=pre来解决删除head时的情况

ps：pre=dump，pre.next改变，dump.next跟着改变

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next

class Solution:
    def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:
        slow = fast = head
        while n>0:
            fast = fast.next
            n -= 1 
        dump = pre = ListNode(0)
        pre.next = slow
        
        while fast:
            fast = fast.next
            slow = slow.next
            pre = pre.next
        pre.next = slow.next

        return dump.next