Leetcode 19. 删除链表的倒数第N个节点

最新推荐文章于 2024-03-18 15:37:36 发布

Bendaai

最新推荐文章于 2024-03-18 15:37:36 发布

阅读量163

点赞数

本文链接：https://blog.csdn.net/bendaai/article/details/79970329

版权

简单题

/**
* 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 *pre = NULL, *l = head, *r = head;
        while (n--) r = r->next;
        while (r) r = r->next, pre = l, l = l->next;
        if (pre) pre->next = l->next;
        else head = l->next;
        delete(l);
        return head;
    }
};