搜索二维矩阵2

Posted 2022-01-31 Alice_yufeng

class Solution 
    public boolean searchMatrix(int[][] matrix, int target) 
        int m = matrix.length, n = matrix[0].length;
        int x = 0, y = n - 1;
        while (x < m && y >= 0) 
            if (matrix[x][y] == target) 
                return true;
            
            if (matrix[x][y] > target) 
                --y;
             else 
                ++x;
            
        
        return false;