19. 删除链表的倒数第N个节点

方法一：暴力法

先计算出长度，再遍历到倒数第N个结点。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        ListNode *dummy= new ListNode(0);	//定义哑结点
        dummy->next=head;	
        int len=0;
        ListNode *p=dummy;	
        while(p->next){		//第一遍算出链表的长度
            p=p->next;
            len++;
        }
        p=dummy;
        int count=1;
        while(count<len-n+1){
            p=p->next;
            count++;
        }
        p->next=p->next->next;
        return dummy->next;
    }
};

方法二：双指针

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        ListNode *dummy=new ListNode(-1);   //哑结点，为了方便删除首结点
        dummy->next=head;
        ListNode* fast=head,*slow=dummy;
        int i=0;
        while(i<n-1){
            fast=fast->next;
            ++i;
        }
        while(fast->next){
            fast=fast->next;
            slow=slow->next;
        }
        slow->next=slow->next->next;
        return dummy->next;
    }
};