- 博客(2)
- 资源 (2)
- 收藏
- 关注
原创 LeetCode21:Merge Two Sorted Lists
题目如下: 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. 很经典的算法,这里贴出递归与非递归的解法。 非递归:/** * Definition for si
2017-10-22 16:03:40 146
原创 LeetCode19:Remove Nth Node From End of List
题目如下: 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 node from the end, the linked
2017-10-22 14:31:55 170
the C program language
2015-08-05
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人