LeetCode 19. Remove Nth Node From End of List

最新推荐文章于 2024-01-12 15:01:11 发布

柳婼

最新推荐文章于 2024-01-12 15:01:11 发布

阅读量364

点赞数 1

CC 4.0 BY-SA版权

文章标签： LeetCode

本文链接：https://blog.csdn.net/liuchuo/article/details/51990773

LeetCode 专栏收录该内容

350 篇文章

订阅专栏

本文介绍了一种高效算法，用于从链表中删除倒数第N个节点。该算法仅需遍历一次链表即可完成操作，提高了处理效率。文中详细解释了双指针技巧的应用，并附带了C++实现代码。

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

19. Remove Nth Node From End of List
My Submissions QuestionEditorial Solution
Total Accepted: 104216 Total Submissions: 355297 Difficulty: Easy
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.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        if(head == NULL || head->next == NULL)
            return NULL;
        ListNode *p = head;
        ListNode *q = head;
        for(int i = 1; i <= n; i++) {
            p = p->next;
        }
        if(p == NULL) {
            head = head->next;
            return head;
        }
        p = p->next;
        while(p != NULL) {
            p = p->next;
            q = q->next;
        }
        q->next = q->next->next;
        return head;
    }
};