剑指OFFER

二维数组查找python实现：
 

# -*- coding:utf-8 -*-
class Solution:
    # array 二维列表
    def Find(self, target, array):
        # write code here
        x = len(array)
        y = len(array[0])
        for i in range(x):
            for j in range(y):
                if array[i][j] < target:
                    pass
                elif array[i][j] == target:
                    return True
                elif array[i][j] > target and j==0:
                    return False
                else:
                    y -= 1
                    break
        return False