Leetcode 19

最新推荐文章于 2025-07-02 15:11:11 发布

转载最新推荐文章于 2025-07-02 15:11:11 发布 · 47 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/cunyusup/p/9620968.html

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
//一开始发现头结点不好删啊，然后加了一个前置节点就ok了

class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        ListNode *add = new ListNode(0);
        add->next = head;
    
        ListNode *end = head;
        ListNode *start = add;
        for(int i=1;i < n;i++){
            end = end->next;
        }
        while(end->next != NULL){
            end = end->next;
            start = start->next;
        }
        start->next = start->next->next;
        return add->next;
    }
};