2014年11月13日
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 re... 阅读全文
posted @ 2014-11-13 16:16 bingtel 阅读(139) 评论(0) 推荐(0)
leetcode--Partition List
摘要： Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should preserve the origi... 阅读全文
posted @ 2014-11-13 13:09 bingtel 阅读(116) 评论(0) 推荐(0)