在行列都有序的二维数组中找数python实现

#File Name : 在行列都有序的数组中找数.py

def findNumInSortMatrix(arr,k):
    if not arr:
        return
    end_r = len(arr) - 1
    end_c = len(arr[0]) - 1
    zr = 0
    zc = end_c
    while zr != end_r+1 and zc != -1:
        if k<arr[zr][zc]:
            zc-=1
        elif k>arr[zr][zc]:
            zr+=1
        else:
            return True
    return False

if __name__ == '__main__':
    li = [[1,3,5,6],
          [2,5,7,9],
          [4,6,8,10]]
    print(findNumInSortMatrix(li,4))