19. Remove Nth Node From End of List**

最新推荐文章于 2026-06-26 23:12:21 发布

原创最新推荐文章于 2026-06-26 23:12:21 发布 · 244 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

LeetCode

当前文章被收录于：

LeetCode

416 篇文章 4 人学习

订阅专栏查看详情

当前文章被以下社区和专栏收录：

本文介绍LeetCode上第19题“Remove Nth Node From End of List”的解决方案，该题要求从链表中删除倒数第N个节点并返回链表头。文章提供了C++实现代码，通过使用虚拟头结点和双指针技巧，实现了仅遍历一次链表的目标。

19. Remove Nth Node From End of List**

https://leetcode.com/problems/remove-nth-node-from-end-of-list/

题目描述

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

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.

Follow up:

Could you do this in one pass?

C++ 实现 1

class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        ListNode *dummy = new ListNode(0);
        dummy->next = head;
        auto q = dummy;
        for (int i = 0; i <= n; ++ i) q = q->next;
        auto prev = dummy;
        while (q) {
            prev = prev->next;
            q = q->next;
        }
        prev->next = prev->next->next;
        return dummy->next;
    }
};