这个是查找最小的数组，和二分查找有点区别，后者是找目标函数，判断语句有点不同，其他基本差不多。

# def binary(list,target):# 二分查找法# left = 0# right = len(list) - 1## while left <= right:#     mid = (left + right) // 2#     if list[mid] == target:#         return mid#     elif list[mid] < target:#         left = mid +1#     else:#         right = mid - 1
def rotate(list):if not list:return 0left = 0right = len(list)-1while left<=right:mid = (left+right)//2if list[mid]<list[mid-1]:return list[mid]elif list[mid]<list[right]:right = mid -1else:left = mid +1
# list = [1,2,3,4,5,6]
list = [6, 0,1, 2,3, 4 ,5]
# print(binary(list,1))
print(rotate(list))