[LeetCode] Remove Nth Node From End of List 溢出链表倒数第N个节点

标签：

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.

[LeetCode] Remove Nth Node From End of List 溢出链表倒数第N个节点

标签：

原文地址：http://www.cnblogs.com/grandyang/p/4606920.html