764. 最大加号标志
思路
们可以事先计算好每个点 (i, j) 左边最长的连续 1 的格子数,用 dp[i][j] 表示。然后 dp 矩阵中的最大值就是结果。同理,这道题就是将一个方向转化为了上下左右四个方向。所以我们只需要事先计算好 up, down, left, right 这四个矩阵就可以了。那么点 (i, j) 能组成的最大的加号阶数就是这四个方向的最小值
class Solution {
public:
int orderOfLargestPlusSign(int n, vector<vector<int>>& mines) {
vector<vector<int>> grid(n, vector<int>(n, INT_MAX)); // 注意要初始化为无穷大
for (auto mine : mines) {
int x = mine[0], y = mine[1];
grid[x][y] = 0;
}
for (int i = 0; i < n; i++) {
int up = 0, down = 0, left = 0, right = 0;
for (int j = 0, k = n - 1; j < n; j++, k--) {
left = grid[i][j] == 0 ? 0 : left + 1;
right = grid[i][k] == 0 ? 0 : right + 1;
up = grid[j][i] == 0 ? 0 : up + 1;
down = grid[k][i] == 0 ? 0 : down + 1;
grid[i][j] = min(grid[i][j], left);
grid[i][k] = min(grid[i][k], right);
grid[j][i] = min(grid[j][i], up);
grid[k][i] = min(grid[k][i], down);
}
}
int res = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
res = max(res, grid[i][j]);
}
}
return res;
}
};