221. 最大正方形
作者:互联网
221. 最大正方形
难度:中等
在一个由 '0'
和 '1'
组成的二维矩阵内,找到只包含 '1'
的最大正方形,并返回其面积。
示例 1:
输入:matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]
输出:4
示例 2:
输入:matrix = [["0","1"],["1","0"]]
输出:1
示例 3:
输入:matrix = [["0"]]
输出:0
提示:
m == matrix.length
n == matrix[i].length
1 <= m, n <= 300
matrix[i][j]
为'0'
或'1'
解答:
class Solution {
//动态规划
//时间复杂度O(MN),空间复杂度O(MN)
public int maximalSquare(char[][] matrix) {
int row = matrix.length;
int col = matrix[0].length;
int[][] dp = new int[row + 1][col + 1];
int max = 0;
for(int i = 1; i <= row; i++){
for(int j = 1; j <= col; j++){
if(matrix[i - 1][j - 1] == '1'){
dp[i][j] = Math.min(dp[i - 1][j - 1], Math.min(dp[i][j - 1], dp[i - 1][j])) + 1;
max = Math.max(dp[i][j], max);
}
}
}
return max * max;
}
}
链接:
}
return max * max;
}
}
**参考自:**
作者:LeetCode-Solution
链接:https://leetcode-cn.com/problems/maximal-square/solution/zui-da-zheng-fang-xing-dong-tai-gui-hua-uek62/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
标签:最大,示例,int,max,Math,正方形,dp,221,matrix 来源: https://blog.csdn.net/qq_37548441/article/details/119208069