leetcode-19-Remove Nth Node From End of List

ont pass!!!

Given a linked list, remove the n-th node from the end of list and return its head.

Example:

Given linked list: 1->2->3->4->5, and n = 2.

After removing the second node from the end, the linked list becomes 1->2->3->5.

Note:

Given n will always be valid.

Follow up:

Could you do this in one pass?

一开始的解法，但是总是过不了下面那种情况

class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        ListNode *fast=head, *slow=head;
        //用两个指针，一个快一个慢，保持两个指针【之间】有n的距离，一起往前找，直到快指针到达结尾
        for(int i=0;i<=n;i++)//注意是保持间隔是n！
            fast=fast->next;
        if(fast==NULL){//考虑长度正好是n的情况
            return head->next;
        while(fast!=NULL){
            fast=fast->next;
            slow=slow->next;
        }
        slow->next = slow->next->next;//要让slow的next是要被删除的那个
        return head;
    }
};

Input: [1,2]1

Output: [2]

Expected: [1]

后来发现应该是二者之间有n-1个数，判断fast->next是否为空来判断是否遍历到头

class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        ListNode *fast=head, *slow=head;
        //用两个指针，一个快一个慢，保持两个指针有n的距离中间有n-1的间隔，一起往前找，直到快指针到达结尾
        for(int i=1;i<=n;i++)//fast指针先跳n步
            fast=fast->next;
        if(fast==NULL){
            return head->next;//如果恰好n就是链表长度，删第一个节点
        }
        while(fast->next!=NULL){//!!!!!之前就是错在这里了！
            fast=fast->next;
            slow=slow->next;
        }
        slow->next = slow->next->next;//要让slow的next是要被删除的那个
        return head;
    }
};