二维数组中的查找

题目：(二维数组中的查找)

给定一个二维数组，其每一行从左到右递增排序，从上到下也是递增排序。给定一个数，判断这个数是否在该二维数组中。

Consider the following matrix:
[
  [1,   4,  7, 11, 15],
  [2,   5,  8, 12, 19],
  [3,   6,  9, 16, 22],
  [10, 13, 14, 17, 24],
  [18, 21, 23, 26, 30]
]

Given target = 16, return true.
Given target = 20, return false.

答案：

let matrix = [
  [1,   4,  7, 11, 15],
  [2,   5,  8, 12, 19],
  [3,   6,  9, 16, 22],
  [10, 13, 14, 17, 24],
  [18, 21, 23, 26, 30]
]
let target = 16

function find(target, matrix) {
    if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
		return false;
    }
    let rows = matrix.length, cols = matrix[0].length;
    let r = 0, c = cols - 1;
    while (r <= rows - 1 && c >= 0) {
        if (target == matrix[r][c]) {
            return true;
        } else if (target > matrix[r][c]) {
            r++;
        }else {
            c--;
        }
    }
    return false;
}

find(target, matrix)  //true

解题思路：