LeetCode 搜索二维矩阵 II

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