【模板总结】二维数组中找到最大方形

最新推荐文章于 2023-02-25 12:03:57 发布

bijian0530

最新推荐文章于 2023-02-25 12:03:57 发布

阅读量314

点赞数

文章标签：算法 leetcode 动态规划

本文链接：https://blog.csdn.net/bijian0530/article/details/125855718

版权

221. 最大正方形

在这里插入图片描述

    public int maximalSquare(char[][] matrix) {
        if(matrix == null || matrix.length == 0 || matrix[0].length == 0){
            return 0;
        }
        int maxSize = 0;
        int[][] dp = new int[matrix.length][matrix[0].length];
        for(int i = 0; i < matrix.length; i++){
            for(int j = 0; j < matrix[0].length; j++){
                if(matrix[i][j] == '1'){
                    if(i == 0 || j == 0){
                        dp[i][j] = 1;
                    }else{
                        dp[i][j] = Math.min(Math.min(dp[i - 1][j], dp[i][j - 1]),
                                            dp[i - 1][j - 1]) + 1;
                    }
                        maxSize = Math.max(maxSize, dp[i][j]);
                    }
            }
        }
        return maxSize * maxSize;
    }

1277. 统计全为 1 的正方形子矩阵

在这里插入图片描述

   public int countSquares(int[][] matrix) {
      if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
         return 0;
      }
      int row = matrix.length;
      int col = matrix[0].length;
      int ans = 0;
      int maxSize = 0;
      int[][] dp = new int[row][col];
      for (int i = 0; i < row; i++) {
         for (int j = 0; j < col; j++) {
            if (matrix[i][j] == 1) {
               if (i == 0 || j == 0) {
                  dp[i][j] = 1;
               } else {
                  dp[i][j] = Math.min(Math.min(dp[i - 1][j], dp[i][j - 1]), dp[i - 1][j - 1]) + 1;
               }
            } 
            ans += dp[i][j];
            maxSize = Math.max(maxSize, dp[i][j]);
         }
      }
      return ans;
   }