摘要：
Find thekth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For exampl... 阅读全文
摘要：
完全抄答案class TrieNode { // Initialize your data structure here. // ref http://www.programcreek.com/2014/05/leetcode-implement-trie-prefix-tree-jav... 阅读全文
摘要：
IYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping y... 阅读全文
摘要：
dfs 参考I II， 切不要K sumFind all possible combinations ofknumbers that add up to a numbern, given that only numbers from 1 to 9 can be used and each combi... 阅读全文
摘要：
http://www.datasciencecentral.com/profiles/blogs/10-python-machine-learning-projects-on-github 阅读全文
摘要：
Real-time interactive movie recommendationhttp://fastml.com/real-time-interactive-movie-recommendation/ 阅读全文
摘要：
refhttp://blog.jobbole.com/84876/ 阅读全文
摘要：
public class Solution { public boolean containsDuplicate(int[] nums) { if(nums==null||nums.length==0) return false; Set s = new HashS... 阅读全文
摘要：
public class Solution { public int[] findOrder(int numCourses, int[][] prerequisites) { int[] re =new int[numCourses] ; int can = 0;... 阅读全文
摘要：
比较难的一道题，但是还是能看懂public class Solution { public List findRepeatedDnaSequences(String s) { // ref http://blog.csdn.net/haiyi727/article/details... 阅读全文