[leetcode]19.删除链表的倒数第N个节点

给你一个链表,删除链表的倒数第 n 个结点,并且返回链表的头结点。

进阶:你能尝试使用一趟扫描实现吗?

示例 1:

输入:head = [1,2,3,4,5], n = 2
输出:[1,2,3,5]

示例 2:

输入:head = [1], n = 1
输出:[]

示例 3:

输入:head = [1,2], n = 1
输出:[1]

提示:

  • 链表中结点的数目为 sz
  • 1 <= sz <= 30
  • 0 <= Node.val <= 100
  • 1 <= n <= sz

思路:求出链表的长度,删除倒数第N个节点

# 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: ListNode, n: int) -> ListNode:
#         dummy = ListNode(0, head)
#         first = head
#         second = dummy
#         for i in range(n):
#             first = first.next

#         while first:
#             first = first.next
#             second = second.next
        
#         second.next = second.next.next
#         return dummy.next


class Solution:
    # def removeNthFromEnd(self, head: ListNode, n: int) -> ListNode:
    #     def getLength(head: ListNode) -> int:
    #         length = 0
    #         while head:
    #             length += 1
    #             head = head.next
    #         return length
        
    #     dummy = ListNode(0, head)
    #     length = getLength(head)
    #     cur = dummy
    #     for i in range(1, length - n + 1):
    #         cur = cur.next
    #     cur.next = cur.next.next
    #     return dummy.next
    def removeNthFromEnd(self, head: ListNode, n: int) -> ListNode:
        def getLength(head:ListNode)->int:
            length = 0
            while head:
                length+=1
                head = head.next
            return length
        dummy = ListNode(0,head)
        length = getLength(head)
        cur = dummy
        for i in range(1,length-n+1):
            cur = cur.next
        cur.next = cur.next.next
        return dummy.next

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值