力扣19题（链表，双指针，快慢指针）

19.给你一个链表，删除链表的倒数第 n 个结点，并且返回链表的头结点。
进阶：你能尝试使用一趟扫描实现吗？

1. 删除第n个结点，很容易就想到了先反转链表然后删除第n个结点后再反转过来，这样貌似要走很多次循环，一开始还怕过不了，但没想到实现效果貌似还行。

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

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

//反转链表
struct ListNode* reverseList(struct ListNode* head){
    //p用来指向q指向的前一个指针，q用来遍历链表
    struct ListNode *p = NULL, *q = head, *temp;
    while (q != NULL) {
        temp = q->next;
        q->next = p;
        p = q;
        q = temp;
    }
    return p;
}


struct ListNode* removeNthFromEnd(struct ListNode* head, int n){
    if (n < 0 || head == NULL)
        return head;
    head = reverseList(head);
    struct ListNode *dummyHead = (struct ListNode*)malloc(sizeof(struct ListNode));
    dummyHead->next = head;
    int count = 0;
    struct ListNode *curNode = dummyHead;
    while (curNode != NULL) {
        if (count == n - 1) 
            break;
        curNode = curNode->next;
        count++;
    }

    if (count == n - 1 && curNode->next != NULL) {
        struct ListNode *p = curNode->next;
        curNode->next = curNode->next->next;
        free(p);
        head = dummyHead->next;
        head = reverseList(head);
        free(dummyHead);
        return head;
    }
    free(dummyHead);
    head = reverseList(head);
    return head;
}

2. 题解使用的解法是利用双指针，设置一个快指针和一个慢指针，然后开始遍历链表，让快指针先走n+1步，然后快慢指针一起走，当快指针到达空元素时，慢指针刚好就指向要删除的元素的前一个元素。这样的原理通过简单计算就能够理解，假设链表长度为len，要删除倒数第n个元素，这样当快指针走了n+1步时，距离空元素还有len - （n+1）+1 = len - n步，当快指针走到空元素时，慢指针就走了len - n步，距离空元素还有len - （len - n) + 1 = n+1步，也就是慢指针刚好到逆向的第n+1个元素。

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

struct ListNode* removeNthFromEnd(struct ListNode* head, int n){
   struct ListNode *dummyHead = (struct ListNode*)malloc(sizeof(struct ListNode));
   dummyHead->next = head;
   struct ListNode *fast, *slow;
   fast = slow = dummyHead;
   while (n-- && fast != NULL) {
       fast = fast->next;
   }
   if (fast == NULL)
        return head;
   fast = fast->next;
   while(fast != NULL) {
       fast = fast->next;
       slow = slow->next;
   }
   slow->next = slow->next->next;
   head = dummyHead->next;
   fast = dummyHead;
   free(fast);
   return head;
}