数组矩阵

难度中等

题目描述

解题思路

从右上角开始搜索

Code

public boolean searchMatrix(int[][] matrix, int target) {
    int i = 0, j = matrix[0].length - 1;
    boolean isFind = false;
    while (i < matrix.length && j >= 0) {
        if (matrix[i][j] > target) {
            j--;
        } else if (matrix[i][j] < target) {
            i++;
        } else {
            isFind = true;
            break;
        }
    }
    return isFind;
}