19. Remove Nth Node From End of List.cpp

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n)
    {
        ListNode* slow = head;
        ListNode* fast = head;
        int temp = n;
        while(n>0)
        {
            fast = fast->next;
            n--;
        }
        if(fast==NULL)
        {
            head = slow->next;
            return head;
        }
        while(fast->next!=NULL)
        {
            slow = slow->next;
            fast = fast->next;
        }
        if(temp==1)
        {
            slow->next=NULL;
            return head;
        }
        slow->next = slow->next->next;
        return head;
    }
};