# -*- coding:utf-8 -*-
class Solution:
# array 二维列表
def Find(self, target, array):
# write code here
r=len(array)
c=len(array[0])
i=r-1
j=0
while (i >= 0 and j <c):
if array[i][j] > target:
i -= 1
elif array[i][j] < target:
j += 1
elif array[i][j] == target:
return True
采用阶梯法比较,降低时间复杂度