study----删除链表的倒数第 N 个结点

weixin_43879335

于 2021-07-17 20:05:35 发布

阅读量50

点赞数

本文链接：https://blog.csdn.net/weixin_43879335/article/details/118861817

版权

给你一个链表，删除链表的倒数第 n 个结点，并且返回链表的头结点。

进阶：你能尝试使用一趟扫描实现吗？

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */


struct ListNode* removeNthFromEnd(struct ListNode* head, int n){
    struct ListNode* q = head;
    struct ListNode* dummy = malloc(sizeof(struct ListNode));
    dummy->val = 0, dummy->next = head;
    struct ListNode* p = dummy;
    int i = 0;
    for(;i < n;i ++){
        q = q -> next;
    }
    while(q != NULL){
        q = q -> next;
        p = p -> next;
    }
    p -> next = p -> next -> next;
    struct ListNode* ans = dummy->next;
    free(dummy);
    return ans;
}