C语言 | Leetcode C语言题解之第19题删除链表的倒数第N个结点

题目:

题解:

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

最近更新

  1. TCP协议是安全的吗?

    2024-04-13 13:06:02       18 阅读
  2. 阿里云服务器执行yum,一直下载docker-ce-stable失败

    2024-04-13 13:06:02       19 阅读
  3. 【Python教程】压缩PDF文件大小

    2024-04-13 13:06:02       18 阅读
  4. 通过文章id递归查询所有评论(xml)

    2024-04-13 13:06:02       20 阅读

热门阅读

  1. Kotlin基础学习

    2024-04-13 13:06:02       14 阅读
  2. 如何对孩子进行编程启蒙?

    2024-04-13 13:06:02       14 阅读
  3. gateway基本配置详解与深入分析

    2024-04-13 13:06:02       15 阅读
  4. 下载软件时候的x86_64,arm是什么意思?

    2024-04-13 13:06:02       13 阅读
  5. MFC:手写一个模态对话框程序

    2024-04-13 13:06:02       15 阅读
  6. springboot @ConditionalOnProperty注解

    2024-04-13 13:06:02       14 阅读
  7. 游戏动画技术:从传统到深度学习

    2024-04-13 13:06:02       16 阅读
  8. 【深度学习】pytorch计算KL散度、kl_div

    2024-04-13 13:06:02       16 阅读