1277. 统计全为 1 的正方形子矩阵
题目链接:1277. 统计全为 1 的正方形子矩阵
代码如下:
            
            
              cpp
              
              
            
          
          class Solution {
public:
	int countSquares(vector<vector<int>>& matrix) {
		int m = matrix.size(), n = matrix[0].size();
		vector f(m + 1, vector<int>(n + 1));
		int res = 0;
		for (int i = 0;i < m;i++) {
			for (int j = 0;j < n;j++) {
				if (matrix[i][j]) {
					f[i + 1][j + 1] = min({ f[i][j],f[i][j + 1],f[i + 1][j] }) + 1;
					res += f[i + 1][j + 1];
				}
			}
		}
		return res;
	}
};