save project

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
 # 使用二分查找法，找出9和20在列表里面的索引
-bingo_num = 20
+night = int(input())
 num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
 num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
 low = 0
 low = 0
 high = len(num_list)-1
 high = len(num_list)-1
 while low <= hight:
 while low <= hight:
     mid = (low+night) // 2
     mid = (low+night) // 2
-    guess == num_list[mid]
+    guess = num_list[mid]
     if guess == num :
     if guess == num :
         print("找到了，他在列表里的索引是：",mid)
         print("找到了，他在列表里的索引是：",mid)
         break
         break