def binarySearch(arr, l, r, x):
# 基本判断
if r >= l:
mid = int(l + (r - l)/2) # 元素整好的中间位置
if arr[mid] == x:
return mid
# 元素小于中间位置的元素,只需要再比较左边的元素
elif arr[mid] > x:
return binarySearch(arr, l, mid-1, x)
# 元素大于中间位置的元素,只需要再比较右边的元素
else:
return binarySearch(arr, mid+1, r, x)
else: # 不存在
return -1
def binar_list(arr, l, r, x):
if r - l >= 0:
mid = (l+r)//2
if arr[mid][0] <= x <= arr[mid][-1]:
return mid
elif arr[mid][-1] < x:
return binar_list(arr, mid+1, r, x)
else:
return binar_list(arr, l, mid-1, x)
else:
return -1
def get_one_num(one_info_list, one_num):
row_index = binar_list(a_list, 0, len(a_list)-1, one_num)
if row_index < 0:
return '不在数组中'
col_index = binarySearch(one_info_list[row_index], 0, len(one_info_list[row_index])-1, one_num)
if col_index < 0:
return '不在数组中'
else:
return row_index, col_index
a_list = [[1, 2, 3, 4,], [5, 6, 7, 8, 9],
[10, 11, 12, 13], [15, 16, 17, 18], [19, 20]]
res = get_one_num(a_list, 13)
print('数组中的位置为:', res)