【Leetcode_easy】840. Magic Squares In Grid

problem

840. Magic Squares In Grid

solution:

class Solution {
public:
    int numMagicSquaresInside(vector<vector<int>>& grid) {
        int m = grid.size(), n = grid[].size();
        int cnt = ;
        for(int i=; i<m-; ++i)
        {
            for(int j=; j<n-; ++j)
            {
                if(isvalid(grid, i, j)) cnt++;
            }
        }
        return cnt;
    }
    bool isvalid(vector<vector<int>>& grid, int i, int j) {
        vector<int> cnt();
        for(int x=i-; x<=i+; x++)//for loop errr...
        {
            for(int y=j-; y<=j+; y++)
            {
                int k=grid[x][y];
                if(k> || k< || cnt[k]==) return false;
                cnt[k] = ;
            }
        }
        if(grid[i][j]!=) return false;
        if(grid[i-][j-]+grid[i-][j]+grid[i-][j+] != ) return false;
        if(grid[i][j-]+grid[i][j]+grid[i][j+] != ) return false;
        if(grid[i+][j-]+grid[i+][j]+grid[i+][j+] != ) return false;
        if(grid[i-][j-]+grid[i][j-]+grid[i+][j-] != ) return false;
        if(grid[i-][j]+grid[i][j]+grid[i+][j] != ) return false;
        if(grid[i-][j+]+grid[i][j+]+grid[i+][j+] != ) return false;
        if(grid[i-][j-]+grid[i][j]+grid[i+][j+] != ) return false;
        if(grid[i-][j+]+grid[i][j]+grid[i+][j-] != ) return false;
        return true;
    }
};

参考

1. Leetcode_easy_840. Magic Squares In Grid;

2. grandyang;

完