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.
Note:
Given n will always be valid.
Try to do this in one pass.
只能扫描一次，设置三个指针temp,pre,cur. 刚开始pre,cur指向head，然后cur向后n-1次，temp每一次都指向pre前面的节点，如果temp为NULL，说明删除的是头节点，直接令head=head->next.若temp!=NULL，则pre所指即为删除的节点，令temp->next=pre->next即可。代码如下：

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