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

把链表中指定的倒数第n个节点删除

下面的实现不是很理想，是不是可以定义前后两个指针一起移动，第一个指针指向一个节点，第二个指针指向第一个指针的后n个节点

最后当第二个指针next为空，就把第一个指针指向它的下一个再下一个指针

struct node {
	struct ListNode* past;
	struct ListNode* next;
};

struct ListNode* removeNthFromEnd(struct ListNode* head, int num) 
{
	struct ListNode* bak = head;
	struct node n[8192] = {0};
	int k = 0;
	struct ListNode* past = NULL;
	while (head) {
		n[k].past = past;
		n[k++].next = head->next;
		past = head;	
		head = head->next;
	}
	if (!n[k - num].past) return bak->next;
	n[k - num].past->next = n[k - num].next;
	return bak;
}