[LeetCode 解题报告]019.Remove Nth Node From End of List

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

caicaiatnbu

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

阅读量91

点赞数

分类专栏： LeetCode 解题报告

本文链接：https://blog.csdn.net/caicaiatnbu/article/details/102733349

版权

LeetCode 解题报告专栏收录该内容

154 篇文章 5 订阅

订阅专栏

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?

内容：删除倒数第k个节点

考察点：快慢指针，ListNode *cur=head, *pre=head, cur先走k步，走完需要注意此时cur有可能指向NULL，删除的节点即为head，然后cur与pre一起走到单链表尾部，此时pre指向待删除节点前一个节点。

/**
 * 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) {
        ListNode* cur = head;
        ListNode* pre = head;
        
        for (int i = 0; i < n; i ++)
            cur = cur->next;
        if (cur == NULL)
            return head->next;
        while (cur->next) {
            pre = pre->next;
            cur = cur->next;
        }
        pre->next = pre->next->next;
        return head;
    }
};

完，