2014年1月16日
[LeetCode] Remove Nth Node From End of List
摘要： Given a linked list, remove thenthnode 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:Givennwill always be valid.Try to do this in one pass.解题 阅读全文
posted @ 2014-01-16 09:27 xchangcheng 阅读(141) 评论(0) 推荐(0)