Leetcode19:删除链表的倒数第 N 个结点

最新推荐文章于 2024-05-23 10:01:13 发布

i晓雨

最新推荐文章于 2024-05-23 10:01:13 发布

阅读量169

点赞数 1

分类专栏： leetcode 链表文章标签：链表数据结构 leetcode

本文链接：https://blog.csdn.net/m0_57200627/article/details/127817071

版权

leetcode 同时被 2 个专栏收录

7 篇文章 0 订阅

订阅专栏

链表

6 篇文章 0 订阅

订阅专栏

基本思路是使用双指针，前一个指针与后一个指针相差n个节点

class Solution:
    def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:
        pre = ListNode(-1,head)
        dummy = pre
        cur = dummy
        if cur.next.next == None:
            return None

        if n == 1:
            cur = cur.next
            while cur.next is not None:
                cur = cur.next
                dummy = dummy.next
            dummy.next = None
            return pre.next
        else:
            while n:
                cur = cur.next
                n = n - 1
            while cur.next is not None:
                cur = cur.next
                dummy = dummy.next
            if dummy.next == head:
                return dummy.next.next
            else:
                dummy.next = dummy.next.next
                return pre.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

leetcode19:删除链表的倒数第 N 个结点