摘要:
Merge k Sorted ListsTotal Accepted:61378Total Submissions:285515Difficulty:HardMergeksorted linked lists and return it as one sorted list. Analyze and... 阅读全文
摘要:
使用二分法处理有序的数时非常有效的方法,能大大提高算法的效率。描述Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm’s runt... 阅读全文
摘要:
所谓的组合就是从给定一组数据中选取若干个组合在一起,没有顺序的差别,所以很容易通过递归(dfs)来实现。实例一(leetcode):Given two integersnandk, return all possible combinations ofknumbers out of 1 ...n.F... 阅读全文
摘要:
问题描述:Given a collection of numbers, return all possible permutations.For example,[1,2,3]have the following permutations:[1,2,3],[1,3,2],[2,1,3],[2,3,1... 阅读全文