数据结构与算法-二维数组中的查找

# -*- coding:utf-8 -*-
class Solution:
    # array 二维列表
    # target 要查找的数
    def Find(self, target, array):
        found = False  # 标志位
        rows = len(array) 
        cols = len(array[0])
        if ((rows > 0) and (cols > 0)): # 边界检测
            row = 0
            col = cols - 1  # 从最后一列开始检查
            while((row < rows) and (col >= 0)):
                if array[row][col] == target: # 右上角的值与目标值相等就返回
                    found = True
                    break
                elif array[row][col] > target: # 右上角的值比目标值大，去掉最后一列
                    col -= 1
                else: # 当右上角的值比目标值小，就去掉这一行
                    row += 1 
        return found



def test1(f): # 查找的数在数组中
  target = 7
  arr = [[1,2,8,9],[2,4,9,12],[4,7,10,13],[6,8,11,15]]
  assert f.Find(target, arr) == True


def test2(f):  # 空数组
  target = 7
  arr = [[]]
  assert f.Find(target, arr) == False


def test3(f):  # 查找的数不在数组中
  target = 5
  arr = [[1,2,8,9],[2,4,9,12],[4,7,10,13],[6,8,11,15]]
  assert f.Find(target, arr) == False


def Test():
  f = Solution()
  test1(f)
  test2(f)
  test3(f)


Test()