摘要: 二分查找 lst = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19] def binary_search(lst,item): low = 0 high = len(lst)-1 while low <= 阅读全文
posted @ 2019-09-14 14:24 lixin[at]hitwh 阅读(314) 评论(0) 推荐(0) 编辑