摘要：
Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area.For example, given the following matr... 阅读全文
摘要：
http://www.quora.com/Whats-the-best-way-to-delete-duplicates-from-a-sorted-array-in-math-O-log-N-math-time-and-math-O-1-math-spacehttps://mtatar.wordp... 阅读全文
摘要：
如果NetworkX不好用，pip uninstall 然后install1) 看每个node的social情况In [1]: import networkx as nxIn [2]: nx.read 比如nx.read_adjlist nx.read_dot nx.read_edgelist这个时... 阅读全文
摘要：
ref: Learning Ipython for interactive computing and data visualizationcode website:http://ipython.rossant.net.启动：基础，可以用powershell在window下实现近似linux操作no... 阅读全文
摘要：
看cast type比较重要，public class Solution { public int sqrt(int x) { // 巧妙使用二分法 // ref http://www.cnblogs.com/springfor/p/3857772.html ... 阅读全文
摘要：
还没刷，感觉好复杂，先把看到的做法记录一下http://blog.csdn.net/kenden23/article/details/18696083 阅读全文
摘要：
The set[1,2,3,…,n]contains a total ofn! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie... 阅读全文
摘要：
简单题public class Solution { public int lengthOfLastWord(String s) { s = s.trim(); if(s==null||s.length()==0) return 0; int len ... 阅读全文
摘要：
数据处理题目摘抄自爱做饭 http://www.cnblogs.com/springfor/p/3870929.html“题解：pow(x,n)就是求x的n次方。x的N次方可以看做：x^n = x^(n/2)*x^(n/2)*x^(n%2)。所以利用递归求解，当n==1的时候，x^n=x。当然n是可... 阅读全文
摘要：
IGiven 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],[3... 阅读全文