LeetCode: Remove Nth Node From End of List

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

For 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.
Try to do this in one pass.

#include<iostream>
#include<string>
using namespace::std;



struct ListNode {
    int val;
    ListNode *next;
	ListNode(int x) : val(x), next(NULL) {}
 };

class Solution {
public:
    ListNode *removeNthFromEnd(ListNode *head, int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
		ListNode *p, *q;
		p = head;
		q = head;
		int i = 0;
		if(n == 0)
			return head;
		while(p != NULL && i < n - 1)
		{
			p = p->next;
			i++;
		}
		if(p == NULL)
			return head;
		if(p->next == NULL)
			return head->next;
		
		
		p = p->next;
		while(p->next != NULL)
		{
			q = q->next;
			p = p->next;
		}
		q->next = q->next->next;
		return head;

    }
};

Round 2:

class Solution {
public:
    ListNode *removeNthFromEnd(ListNode *head, int n) {
		if(head == NULL)
			return head;
        ListNode *p1 = head, *p2 = head;
		int iter = n;
		while(iter > 0)
		{
			p1 = p1->next;
			iter--;
		}
		if(p1 == NULL)
			return p2->next;
		while(p1 -> next != NULL)
		{
			p2 = p2->next;
			p1 = p1->next;
		}
		p2->next = p2->next->next;
		return head;
    }
};

Round 3:

class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        if(n <= 0)
			return head;
		ListNode *p1 = head, *p2 = head;
		while(n > 0)
		{
			p2 = p2->next;
			n--;
		}
		if(p2 == NULL)
		{
			head = head->next;
			return head;
		}
		while(p2->next != NULL)
		{
			p1 = p1->next;
			p2 = p2->next;
		}
		p1->next = p1->next->next;
		return head;

    }
};