[WXM] LeetCode 764. Largest Plus Sign C++

本文链接：https://blog.csdn.net/WX_ming/article/details/82145209

764. Largest Plus Sign

In a 2D grid from (0, 0) to (N-1, N-1), every cell contains a 1, except those cells in the given list mines which are 0. What is the largest axis-aligned plus sign of 1s contained in the grid? Return the order of the plus sign. If there is none, return 0.

An “axis-aligned plus sign of 1s of order k” has some center grid[x][y] = 1 along with 4 arms of length k-1 going up, down, left, and right, and made of 1s. This is demonstrated in the diagrams below. Note that there could be 0s or 1s beyond the arms of the plus sign, only the relevant area of the plus sign is checked for 1s.

Examples of Axis-Aligned Plus Signs of Order k:

Example 1:

Input: N = 5, mines = [[4, 2]]
Output: 2
Explanation:
11111
11111
11111
11111
11011
In the above grid, the largest plus sign can only be order 2.  One of them is marked in bold.

Example 2:

Input: N = 2, mines = []
Output: 1
Explanation:
There is no plus sign of order 2, but there is of order 1.

Example 3:

Input: N = 1, mines = [[0, 0]]
Output: 0
Explanation:
There is no plus sign, so return 0.

Note:

N will be an integer in the range [1, 500].
mines will have length at most 5000.
mines[i] will be length 2 and consist of integers in the range [0, N-1].
(Additionally, programs submitted in C, C++, or C# will be judged with a slightly smaller time limit.)

Approach

题目大意给你一个N表示长度为N元素全为1的方阵，还有mines数组里面是等于零的坐标，然后问你可以组成加号的最长边长为多少（只用算一边），这道题与组成正方形的最长边长多长的问题有点类似，不过思想都是相同的，这里有两个版本，一个暴力但直观的解法，一个将暴力解法优化但不直观的解法，我们怎么暴力呢，我们直接算4次上下左右，记录元素的上下左右最长为多少，然后取最小值就是答案了，剩余看代码吧。

Code

暴力解法

class Solution {
public:
    int orderOfLargestPlusSign(int N, vector<vector<int>>& mines) {
        vector<vector<int>>grip(N, vector<int>(N, 1));
        for (vector<int> &m : mines) {
            grip[m[0]][m[1]] = 0;
        }
        vector<vector<int>>a = grip;
        for (int j = 1; j < N - 1; j++) {
            for (int i = N - 2; i >= 1; i--) {
                if (a[i][j])a[i][j] += a[i + 1][j];
            }
        }
        vector<vector<int>>b = grip;
        for (int j = 1; j < N - 1; j++) {
            for (int i = 1; i < N - 1; i++) {
                if (b[i][j])b[i][j] += b[i - 1][j];
            }
        }
        vector<vector<int>>c = grip;
        for (int i = 1; i < N - 1; i++) {
            for (int j = 1; j < N - 1; j++) {
                if (c[i][j])c[i][j] += c[i][j - 1];
            }
        }
        vector<vector<int>>d = grip;
        for (int i = 1; i < N - 1; i++) {
            for (int j = N - 2; j >= 1; j--) {
                if (d[i][j])d[i][j] += d[i][j + 1];
            }
        }
        int maxn = 0;
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                if (i == 0 || j == 0 || i == N - 1 || j == N - 1) {
                    maxn = max(grip[i][j], maxn);
                    continue;
                }
                maxn = max(maxn, min(d[i][j], min(c[i][j], min(b[i][j], a[i][j]))));
            }
        }
        return maxn;
    }
};

优雅解法

class Solution {
public:
    int orderOfLargestPlusSign(int N, vector<vector<int>>& mines) {
        vector<vector<int>>dp(N, vector<int>(N, N));
        for (vector<int> &m : mines) {
            dp[m[0]][m[1]] = 0;
        }
        for (int i = 0; i < N; i++) {
            int u = 0, d = 0, r = 0, l = 0;
            for (int j = 0, k = N - 1; j < N; j++, k--) {
                dp[i][j] = min(dp[i][j], r = (dp[i][j] ? r + 1 : 0));
                dp[j][i] = min(dp[j][i], d = (dp[j][i] ? d + 1 : 0));
                dp[i][k] = min(dp[i][k], l = (dp[i][k] ? l + 1 : 0));
                dp[k][i] = min(dp[k][i], u = (dp[k][i] ? u + 1 : 0));
            }
        }
        int maxn = 0;
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                maxn = max(maxn, dp[i][j]);
            }
        }
        return maxn;
    }
};