摘要：
其实，这些代码都是《学习Opencv》这本书上的。转自：http://www.cnblogs.com/ma6174/archive/2013/03/31/2991315.html这个博客的Python代码是用CV写的，而我的是cv2,改过来之后有各种错误。opencv写的这个有调用摄像头的部分，第一... 阅读全文
摘要：
Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For exampl 阅读全文
摘要：
Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telepho 阅读全文
摘要：
代码是在开源中国上看到的，源代码网址：http://www.oschina.net/code/snippet_2365439_48010需要安装graphics模块，下载地址：http://mcsp.wartburg.edu/zelle/python/graphics.py 保存到C:\Python... 阅读全文
摘要：
转自：http://my.oschina.net/u/175377/blog/84420#OSC_h2_23Scikit Learn: 在python中机器学习Warning警告：有些没能理解的句子，我以自己的理解意译。翻译自：Scikit Learn:Machine Learning in Pyt... 阅读全文
摘要：
Linked List Cycle I Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? 该问题是经典面试问题，其标准解法是用两 阅读全文
摘要：
查找文件夹下的所有子文件import osallfile=[]def dirlist(path): filelist=os.listdir(path) #fpath=os.getcwd() for filename in filelist: # allfile.appen... 阅读全文
摘要：
Next Permutation Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangem 阅读全文
摘要：
Permutations I Given a collection of distinct numbers, return all possible permutations. For example, [1,2,3] have the following permutations: [1,2,3] 阅读全文
摘要：
Subsets I Given a set of distinct integers, nums, return all possible subsets. Note: Elements in a subset must be in non-descending order. The solutio 阅读全文