- 博客(4)
- 收藏
- 关注
RSS订阅转载 Kadane's algorithm (maximum subarray)
Use max_so_far and max_ending 转载于:https://www.cnblogs.com/jjjiajia/p/8826735.html
2018-04-14 02:01:00
87
转载 FB, Microsoft Merge Intervals
Given a collection of intervals, merge all overlapping intervals. For example,Given[1,3],[2,6],[8,10],[15,18],return[1,6],[8,10],[15,18]. The follow up question is can you not use extra space...
2018-04-10 06:43:00
65
转载 Microsoft leetcode(Merge K Sorted Lists)
Mergeksorted linked lists and return it as one sorted list. Analyze and describe its complexity. There are two ways, first use ArrayList to rewrite the linkedlist array, then sort it and use a...
2018-02-18 07:42:00
66
转载 Microsoft leetcode (Symmetric Tree)
Symmetric Tree Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree[1,2,2,3,4,4,3]is symmetric: 1 / \ 2 2...
2018-02-16 10:00:00
71
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人