删除倒数第n个链表的值

遍历法，
struct Node {
int val;
struct Node *next;
};

void deleteNode(struct Node *temp, int n) {
struct Node *start = temp;
int len = 1;

if (temp == null)
    return;
    
while (start != null) {
    start = start->next;
    len++;
}

if (len < n) {
    printf("error");
    return;
}

start = temp;
struct Node *temp1 = start;

if (len == n) {
    start = start->next;
    delete(start);
}

for (int i = 0; i < (len - n); i++) {
    temp1 = start;
    start = start->next;
}

temp1->next = start->next;
delete(start);

return;

}

来源：CSDN

作者：technology_yu

链接：https://blog.csdn.net/u013436730/article/details/103616682