Leetcode: Maximal Square

Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area.

For example, given the following matrix:1 0 1 0 0
1 0 1 1 1
1 1 1 1 1
1 0 0 1 0
Return 4.

dp问题，用一个dp[i][j]保存matrix[i][j]作为右下节点的时候的最大矩形的边长

if (matrix[i][j] == '0') dp[i][j] = 0;

else dp[i][j] = min(dp[i-1][j-1], dp[i-1][j], dp[i][j-1]) + 1;

 1 public class Solution {
 2     public int maximalSquare(char[][] matrix) {
 3         int res = 0;
 4         if (matrix==null || matrix.length==0 || matrix[0].length==0) return res;
 5         int[][] dp = new int[matrix.length][matrix[0].length];
 6         int maxEdge = 0;
 7         for (int i=0; i<matrix.length; i++) {
 8             if (matrix[i][0] == '1') dp[i][0] = 1;
 9             else dp[i][0] = 0;
10             maxEdge = Math.max(maxEdge, dp[i][0]);
11         }
12         for (int j=1; j<matrix[0].length; j++) {
13             if (matrix[0][j] == '1') dp[0][j] = 1;
14             else dp[0][j] = 0;
15             maxEdge = Math.max(maxEdge, dp[0][j]);
16         }
17         for (int i=1; i<matrix.length; i++) {
18             for (int j=1; j<matrix[0].length; j++) {
19                 if (matrix[i][j] == '0') {
20                     dp[i][j] = 0;
21                     continue;
22                 }
23                 dp[i][j] = Math.min(dp[i-1][j-1], Math.min(dp[i-1][j], dp[i][j-1])) + 1;
24                 maxEdge = Math.max(maxEdge, dp[i][j]);
25             }
26         }
27         return maxEdge * maxEdge;
28     }
29 }

Leetcode: Maximal Square相关推荐

LeetCode Maximal Square(最大子矩阵)
问题:给出一个由0,1组成的二维数组,求由1组成的最大子矩阵思路:第一种方式使用暴力法,在遍历二维数组时,如果当前元素是1,则以当前位置为起点,判断先增的一行,一列是否全是1,如果是,则将当前边长度 ...
【动态规划】leetcode - Maximal Square
称号: Maximal Square Given a 2D binary matrix filled with 0's and 1's, find the largest square contain ...
leetcode: Largest Rectangle in Histogram，Maximal Square，Maximal Square问题
Largest Rectangle问题题目描述 Given n non-negative integers representing the histogram's bar height where ...
LeetCode Top 100 Liked Questions 221. Maximal Square (Java版； Medium)
welcome to my blog LeetCode Top 100 Liked Questions 221. Maximal Square (Java版; Medium) 题目描述 Given a ...
经典算法题之Maximal Square
点击上方"小白学视觉",选择加"星标"或"置顶" 重磅干货,第一时间送达作者:叶虎 Maximal Square是道非常有意思的算 ...
leetcode 221. Maximal Square | 221. 最大正方形（优化的暴力解法+动态规划解法）
题目 https://leetcode.com/problems/maximal-square/ 题解方法1:最暴力解 O((m*n)^2) public class Solution {publi ...
LeetCode 221. Maximal Square (最大正方形)
原题 Given a 2D binary matrix filled with 0's and 1's, find the largest square containing only 1's and ...
【LeetCode从零单排】No221.Maximal Square
题目 Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and ...
[leetcode ]221. Maximal Square c语言
题目: Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and ...
[Swift]LeetCode221. 最大正方形 | Maximal Square
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★ ➤微信公众号:山青咏芝(shanqingyongzhi) ➤博客园地址:山青咏芝(https://www.cnblog ...

Leetcode: Maximal Square

Leetcode: Maximal Square相关推荐

最新文章

热门文章