/*
* @lc app=leetcode.cn id=19 lang=c
*
* [19] 删除链表的倒数第 N 个结点
*/
// @lc code=start
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode *removeNthFromEnd(struct ListNode *head, int n)
{
struct ListNode head_;
head_.next = head;
struct ListNode *p = &head_;
struct ListNode *q = &head_;
// p -> n
for (int i = 0; i < n; i++)
{
if (p == NULL)
return head;
p = p->next;
}
// q-> head p-> 正数n
while (p->next != NULL)
{
q = q->next;
p = p->next;
}
// delete q->next
struct ListNode *del = q->next;
q->next = q->next->next;
free(del);
return head_.next;
}
// @lc code=end
标签：结点,ListNode,struct,int,head,next,链表,倒数第 From： https://www.cnblogs.com/angdh/p/17970376