暴搜
设从(r, c)向右向下组成的矩阵的值为A(r, c),则有:
A ( r , c ) = A ( r + 1 , c ) + A ( r , c + 1 ) − A ( r + 1 , c + 1 ) + T ( r , c ) A(r, c) = A(r + 1, c) + A(r, c + 1) - A(r + 1, c + 1) + T(r, c) A(r,c)=A(r+1,c)+A(r,c+1)−A(r+1,c+1)+T(r,c)
其中,T(r, c)表示从(r, c)开始,包含(r, c)的方阵个数
若 matrix[r][c] == 1 则
T = 1 + min(T(r + 1, c), T(r, c + 1), T(r + 1, c + 1)
否则
T = 0
当然这已经不是真正的暴力了,不过依然很暴力(=_=
递推
上面爆搜的过程其实就是从右下角往上递推,那么也可以从左上角向下递推,只要把值存起来就行。递推的时候依然需要记录两个值,一个是所有方阵的个数,一个是从(i, j)向左向上,包含(i, j)的方阵个数。
dp[i][j] = dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] + T[i][j]
T[i][j] = (1 + min(T[i - 1][j - 1], T[i - 1][j], T[i][j - 1])) if matrix[i][j] == 1 else 0
代码
struct State {
int maxSquareSize, value;
};
class Solution {
public:
int countSquares(vector<vector<int>> &matrix) {
const size_t rowSize = matrix.size(), colSize = matrix[0].size();
vector<vector<State>> dp(rowSize, vector<State>(colSize));
dp[0][0] = {matrix[0][0], matrix[0][0]};
for (size_t i = 1; i < rowSize; i++) dp[i][0] = {matrix[i][0], matrix[i][0] + dp[i - 1][0].value};
for (size_t j = 1; j < colSize; j++) dp[0][j] = {matrix[0][j], matrix[0][j] + dp[0][j - 1].value};
for (size_t i = 1; i < rowSize; i++) {
for (size_t j = 1; j < colSize; j++) {
int tmpRes = dp[i - 1][j].value + dp[i][j - 1].value - dp[i - 1][j - 1].value;
if (matrix[i][j] == 1) {
int maxSquareSize = 1 + min(dp[i - 1][j].maxSquareSize, min(dp[i][j - 1].maxSquareSize, dp[i - 1][j - 1].maxSquareSize));
dp[i][j] = {maxSquareSize, tmpRes + maxSquareSize};
} else {
dp[i][j] = {0, tmpRes};
}
}
}
return dp[rowSize - 1][colSize - 1].value;
}
};