linked-list
文章平均质量分 60
Juxin_Lin
这个作者很懒,什么都没留下…
展开
-
【LeetCode】19. Remove Nth Node From End of List
Difficulty: Easy 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 removing the second原创 2017-01-07 10:49:38 · 239 阅读 · 0 评论 -
【LeetCode】21. Merge Two Sorted Lists
Difficulty: Easy Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 思路比较简单,不断比较取出来的2个节点的大小,把小的加入新的链表,时间原创 2017-01-07 12:05:18 · 205 阅读 · 0 评论