==============================================================================
【id】#19
【title】Remove Nth Node From End of List
【description】
Given a linked list, remove the n-th node from the end of list and return its head.
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.
Follow up:
Could you do this in one pass?
【idea】
要求是遍历一遍就要解决问题。首先要找到倒数第n个节点,利用两个指针pre和cur,初始化都在head。cur向前移动n步,如果此时cur为空指针,说明n为链表长度