【LeetCode】19. Remove Nth Node From End of List

最新推荐文章于 2024-09-27 15:30:00 发布

陈胖纸

最新推荐文章于 2024-09-27 15:30:00 发布

阅读量63

点赞数

分类专栏： Leetcode 文章标签：链表数据结构算法 C++ 节点删除

本文链接：https://blog.csdn.net/chenqiuyu10/article/details/123350021

版权

Leetcode 专栏收录该内容

24 篇文章 0 订阅

订阅专栏

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

Example 1:

Input: head = [1,2,3,4,5], n = 2
Output: [1,2,3,5]

Example 2:

Input: head = [1], n = 1
Output: []

Example 3:

Input: head = [1,2], n = 1
Output: [1]

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        ListNode *sta = new ListNode(0);
        ListNode *slow =sta;
        ListNode *fast = sta;
        slow->next = head;
        for (int i=0;i<n;i++)
            fast=fast->next;
        while (fast->next){
            fast = fast->next;
            slow =slow->next;
            
        }
        slow->next =slow->next->next;
        return sta->next;
    }
};