74. Search a 2D matrix

public class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        if(matrix == null || matrix.length == 0 || matrix[0].length == 0){
            return false;
        }
        int row = matrix.length;
        int col = matrix[0].length;
        for(int i = 0; i < row; i++){
            if(matrix[i][0] == target){
                return true;
            }else if(matrix[i][0] < target && i + 1 < row && matrix[i + 1][0] > target){
                for(int j = 1; j < col; j++){
                    if(matrix[i][j] == target){
                        return true;
                    }else if(matrix[i][j] > target){
                        return false;
                    }
                }
            }
            // judge the final line
            if(i == row - 1){
                for(int j = 1; j < col; j++){
                    if(matrix[i][j] == target){
                        return true;
                    }else if(matrix[i][j] > target){
                        return false;
                    }
                }
            }
        }
        return false;
    }
}