摘要:
1 var arr1 = [1,2,3,3,4,4,5,6], 2 arr2 = []; 3 for(var i=0; i < arr1.length; i++){ 4 if(arr2.indexof(arr1[i]) < 0{ 5 arr2.push(arr1[i]); 6 } 7 } 8 9 d 阅读全文
摘要:
1 var quicksort = function(arr){ 2 if(arr.length <= 1){ 3 return arr; 4 } 5 var pivotIndex = matn.floor(arr.length/2); 6 var pivot = arr.splice(pivotI 阅读全文
摘要:
1 def gcd(a, b): 2 while a != 0: 3 a, b = b % a, a 4 5 return b 定理:两个整数的最大公约数等于其中较小的那个数和两数相除余数的最大公约数。最大公约数(Greatest Common Divisor)缩写为GCD。 gcd(a,b) = 阅读全文
摘要:
http://blog.codinglabs.org/articles/theory-of-mysql-index.html 阅读全文
摘要:
阅读全文
摘要:
阅读全文
摘要:
阅读全文
摘要:
给定一个数组,构建二叉树,并且按层次打印这个二叉树 ## 14 二叉树节点 class Node(object): def __init__(self, data, left=None, right=None): self.data = data self.left = left self.righ 阅读全文
摘要:
1 def quick_sort(arr): 2 if len(arr) <= 1: 3 return arr 4 else: 5 base = arr[0] 6 less = [v for v in arr[1:] if v<=base] 7 more = [v for v in arr[1:] 阅读全文
摘要:
二分查找 1 def binarySearch(l, t): 2 low, high = 0, len(l) - 1 3 while low < high: 4 print low, high 5 mid = (low + high) / 2 6 if l[mid] > t: 7 high = mi 阅读全文