摘要: 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 @ 2017-10-23 20:19 乐乐章 阅读(142) 评论(0) 推荐(0) 编辑