85. 最大矩形

    /**
     * 动态柱形图法
     * @param matrix
     * @return
     */
    public static int maximalRectangle(String[][] matrix) {

        //先算出每一行 最大连续1的个数
        //如数组是  "1","0","1","1","1"
        //则转换成 1,0,1,2,3
        if(matrix.length == 0 || matrix[0].length==0)return 0;
        int rsize = matrix.length;
        int csize = matrix[0].length;
        int[][] a = new int[rsize][csize];
        for (int i = 0; i < rsize; i++) {
            for (int j = 0; j < csize; j++) {
                if(matrix[i][j]=="1"){
                    a[i][j] = (j == 0 ? 0 : a[i][j-1])+1;
                }
            }
        }

        //遍历每一行（以此为矩形的下边），向上找到最大高度
        int area = 0;
        for (int i = 0; i < rsize; i++) {
            for (int j = 0; j < csize; j++) {
                int width = a[i][j];
                area = Math.max(area,width);
                for (int k = i-1; k >= 0; k--) {
                    width = Math.min(width,a[k][j]);
                    area = Math.max(area,width*(i-k+1));
                }
            }
        }
        return area;
    }