LeetCode----Remove Nth Node From End of List

本文介绍了一种高效算法,用于从链表中删除倒数第N个节点。通过构建一个长度为N的尺子进行一次遍历即可完成操作,详细解析了尺子的构建与使用过程。

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

Remove Nth Node From End of List

Given a linked list, remove the nth node from the end of list and return its head.

For example,

   Given linked list: 1->2->3->4->5, and n = 2.

   After removing the second node from the end, the linked list becomes 1->2->3->5.

Note:
Given n will always be valid.
Try to do this in one pass.

分析:

构建一个尺子,尺子长度为n,尺子顺着链表遍历,当尺子尾到达链表尾的时候,尺子头部记录要删除的结点,One pass算法。


代码:

class Solution(object):
    def removeNthFromEnd(self, head, n):
        """
        :type head: ListNode
        :type n: int
        :rtype: ListNode
        """
        # 构建一个长度为n的尺子
        rulertail = head
        rulerhead = head
        rulerheadpre = head
        flag = True
        for i in range(n - 1):
            rulertail = rulertail.next
        while rulertail.next is not None:
            rulertail = rulertail.next
            rulerhead = rulerhead.next
            if flag:
                flag = False
            else:
                rulerheadpre = rulerheadpre.next
        # 删除倒数第n个元素
        if rulerhead == rulertail:
            if head == rulerhead:
                return None
            rulerheadpre.next = None
        else:
            rulerhead.val = rulerhead.next.val
            rulerhead.next = rulerhead.next.next
        return head
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值