DP--0-1矩阵判断1构成的正方形

221. Maximal Square

Medium

147335FavoriteShare

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

Example:

Input: 

1 0 1 0 0
1 0 1 1 1
1 1 1 1 1
1 0 0 1 0

Output: 4

class Solution {
public:
    int maximalSquare(vector<vector<char>>& matrix) {
        int result = 0; 
	if (matrix.size() == 0 || matrix[0].size() == 0) {
		return 0;
	}
	vector<vector<int>>dp(matrix.size(), vector<int>(matrix[0].size(), 0));
	for (int i = 0; i < matrix.size(); i++) {
		if (matrix[i][0] == '1') {
			dp[i][0] = 1;
			result = 1;//靠左边这一列最大正方形边长为1
		}
	}
	for (int j = 0; j < matrix[0].size(); j++) {
		if (matrix[0][j] == '1') {
			dp[0][j] = 1;
			result = 1;//最上边这一行最大正方形边长为1
		}
	}
	for (int i = 1; i < matrix.size(); i++) {
		for (int j = 1; j < matrix[0].size(); j++) {
			if (matrix[i][j] == '1') {
				dp[i][j] = min(dp[i - 1][j], min(dp[i - 1][j - 1], dp[i][j - 1])) + 1;
				result = max(result, dp[i][j]);
			}
		}
	}
	return result * result;
    }
};