LeetCode19:Remove Nth Node From End of List

Given a linked list, remove the nth 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.

#include<iostream>
#include<algorithm>
using namespace std;


 //definition for singly-linked list.
struct ListNode {
    int val;
	ListNode *next;
	ListNode(int x) : val(x), next(NULL) { }
 };

//设置两个指针p跟q。p指针先移动n步，若此时p指针为空，则表示要删除的是头节点，
//此时直接返回head->next即可。如果first指针不为空，则将两个指针一起移动，
//直到p指针指向最后一个节点，令q->next=q->next->next即可删除第你n个节点。 
class Solution
{
public:
	ListNode *removeNthFromEnd(ListNode *head, int n) {

		if (head == NULL || head->next == NULL)
			return NULL;

		ListNode * p = head;
		ListNode * q = head;

		for (int i = 0; i < n; i++)
			p = p->next; //first指针先移动n步

		if (p == NULL) //若此时first指针为空，则表示要删除的是头节点
			return head->next;

		while (p->next != NULL) //如果first指针不为空，则将两个指针一起移动
		{
			p = p->next;
			q = q->next;
		}

		q->next = q->next->next;
		return head;
	}
};