思路:二維數組由上到下,由左到右遞增,可以選取右上角或者左下角的元素a[row][col]與target進行比較,
當target小於元素a[row][col]時,target必定在a[row][col]所在行的左邊,
當target大於元素a[row][col]時,target必定在a[row][col]所在列的下邊
代碼實現:
def Find( target, array):
# write code here
n_row = len(array)
n_col = len(array[0])
row = 0
col = n_col - 1
while row < n_row and col >= 0:
if(target == array[row][col]):
return True
elif(target > array[row][col]):
row += 1
else:
col -= 1
return False