算法-杨氏矩阵查找

二维数组中数字为升序

// 从矩阵的四个角处开始递归运行,以下为左上角开始
functionsearch(nums, target) {
    for (let i = 0; i < nums.length; i++) {
        var arr = nums[i];
        var start = 0;
        while (start < arr.length) {
            if (arr[start] < target) {
                start++;
            } else if (arr[start] === target) {
                return true
            } else if (arr[start] > target) {
                start--;
                break;
            }
        }
        if (start < 0) {
            return false
        }
    }
}
var ar = [[1, 2, 8, 9], [2, 4, 9, 12], [4, 7, 10, 13], [6, 8, 11, 15]];
var a = search(ar, 15)
console.log(a) // true