19. Remove Nth Node From End of List [LeetCode]_iven a linked list, remove the n-th node from the -CSDN博客

本文介绍了一种高效的方法来解决从链表中移除倒数第N个节点的问题。提供了两种实现思路：一种是先计算链表长度，再定位到待删除节点并删除；另一种是使用双指针技巧，简化了计数过程，使得代码更加简洁。这两种方法都能有效地解决问题，并通过LeetCode平台验证。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

/**************************************************************************
 * 
 * 19. [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)
 * 
 * Given the head of a linked list, remove the nth node from the end of the list and return its head.
 * 
 * Example:
 * Input: head = [1,2,3,4,5], n = 2
 * Output: [1,2,3,5]
 * 
 **************************************************************************/

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

///
///
/// Approach 1: 
int lenList(NODE *head) {
    int len = 0;
    while (head) {
        len++;
        head = head->next;
    }
    return len;
}

NODE *removeNthFromEnd(NODE *head, int n){
    int len = lenList(head);
    if (len < 1 || n < 1 || n > len) return head;
    NODE dummy;
    dummy.next = head;
    NODE *pre = &dummy;
    
    int step = len - n;
    for (int i = 0; i < step; i++) 
        pre = pre->next;

    
    NODE *del = pre->next;
    pre->next = del->next;
    free(del);
    return dummy.next;
}


///
///
/// Approach 1: 
NODE *removeNthFromEnd(NODE *head, int n){
    if (NULL == head || n < 1) return head;
    NODE dummy;
    dummy.next = head;
    NODE *pre = &dummy;
    NODE *tail= &dummy;
    
    for (int i = 0; i < n; i++) {
        if (NULL == tail) return head; //out of range
        tail = tail->next;
    }
    
    while (tail->next) {
        pre = pre->next;
        tail = tail->next;
    }
    
    NODE *del = pre->next;
    pre->next = del->next;
    free(del);

    return dummy.next;
}