Remove Nth Node From End of List
Given a linked list, remove the nth node from the end of list and return its head.
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.
Given n will always be valid.
Try to do this in one pass.
The key to solve this problem is to use two pointers: pre and cur. The pre pointer moves N steps in the first place,[Read More...]