Knock knock...

摘要： ```# 二分查找def bin_search(li, val): # 有序列表 low = 0 high = len(li)-1 while low val: high = mid - 1 else: # li[mid]<val low = mid + 1 return -1``` 阅读全文

摘要： ``` def fibbonacci(n): if not isinstance(n, int): raise ValueError('n is int type') resulet = [0, 1] if n in resulet: return resulet[n] fibbo2 = 0 # n-2的项 fibbo1 = 1 # n-1的项 fibbon = 0 # n for i in ra 阅读全文