python
SekFu
这个作者很懒,什么都没留下…
展开
-
leecode
def singleNumber(nums): nums.sort() i = 0 while i < len(nums) - 1: if (nums[i] != nums[i + 1]): return nums[i] i += 2 if i >= len(nums) - 1: ...原创 2019-02-21 20:24:30 · 208 阅读 · 0 评论 -
class 'cv2.CascadeClassifier' returned a result with an error set
import os.pathimport cv2def faceDetect(src): passdef main(): if not os.path.isfile('haarcascade_frontalface_default.xml'): raise RuntimeError("%s: not found" % 'haarcascade_frontalf...原创 2019-02-17 21:23:17 · 8560 阅读 · 0 评论 -
Python 中做的几道数组算法题
#!/usr/bin/pythonimport mathdef remvoeDulpicates(array): for i in range(len(array)): j = i + 1 while(j < len(array)): if array[i] == array[j]: del ...原创 2019-02-19 19:14:28 · 328 阅读 · 0 评论 -
深度优先和广度优先算法2
#!/usr/bin/pythonary = [[0 ,1, 1, 1000, 1], [1, 0, 1000, 1, 1000], [1, 1000, 0, 1000, 1000], [1000, 1, 1000, 0, 1000], [1, 1000, 1000, 1000, 0]]n = 0m = 5book = [0 for i in range(5)]def dfs(cur)...原创 2019-03-07 20:10:56 · 233 阅读 · 0 评论