在一个二维数组中,每一行都按照从左到右递增的顺序排序,每一列都按照从上到下递增的顺序排序。完成一个函数,输入这样一个二维数组和证书,判断数组中是否含有该整数
# -*- coding:utf-8 -*-
class Solution:
# array 二维列表
def Find(self, target, array):
# write code here
cols = len(array[0])-1
rows = len(array)-1
i = rows
j = 0
while i >= 0 and j <= cols:
if target > array[i][j]:
j += 1
elif target < array[i][j]:
i -= 1
else:
print("value exists" )
return True
else:
return False
if __name__ == "__main__":
sol = Solution()
sol.Find(target=2,array=[[2,3,4,5],[6,7,8,9]])