leetcode 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.

Note:
Given n will always be valid.

Try to do this in one pass.

题目意思是删除倒数第n个元素，这个也要用双指针做（以后看到链表就要想到双指针）,可以先让fast指针走n步，然后fast 和slow每次走一步，fast到头的时候slow的下一个就是要删除的元素了。

要注意的地方是如果删除的元素是第一个，就直接把下一个赋给head就行了。

class Solution {
	//类似一快一慢指针，快的比慢的先走n步，然后各自走一步，快的到底的时候慢的下一个就是要删除的
public:
	ListNode* removeNthFromEnd(ListNode* head, int n) {
		if (!head) return NULL;
		ListNode* slow = head, *fast = head;
		for (int i = 0; i < n; i++)
		{
			fast = fast->next;
		}
		if (fast==NULL)
		{
			head = head->next;
			return head;
		}
		while (fast->next)
		{
			fast = fast->next;
			slow = slow->next;
		}
		//此时slow的下一个节点就是需要删除的节点
		slow->next = slow->next->next;
		return head;
	}
};