算法-搜索二维矩阵

class Solution {
    
    
    public boolean searchMatrix(int[][] matrix, int target) {
    
    
        if(matrix == null || matrix.length == 0) return false;

        int row = matrix.length;
        int col = matrix[0].length;

        int r = 0;
        int c = col - 1;

		//从右上角开始遍历
        while(r <= row - 1 && c >= 0) {
    
    

            if(matrix[r][c] == target) {
    
    
                return true;
            }else if(matrix[r][c] > target) {
    
    
                c--;
            }else if(matrix[r][c] < target) {
    
    
                r++;
            }
        }

        return false;
    }
}