class Solution1:
def Find(self,target,array):
for i in range(len(array)):
for j in range(len(array[i])):
if array[i][j] == target:
return True
return False
class Solution2:
def Find(self,target,array):
row = len(array)
col = len(array[0])
i = 0
j = len(array[0])-1
while i<row and j>=0:
if array[i][j] == target:
return True
elif array[i][j] > target:
j -= 1
else:
i += 1
return False
if __name__ == '__main__':
s1 = Solution1()
print(s1.Find(12,array))
s2 = Solution2()
print(s2.Find(11,array))
剑指offer——二维数组中查找
最新推荐文章于 2022-07-03 19:44:12 发布