摘要: 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 rem 阅读全文
posted @ 2016-02-26 23:50 水果拼盘武士G 阅读(91) 评论(0) 推荐(0)