840. Magic Squares In Grid

最新推荐文章于 2024-09-09 22:01:06 发布

就是那个党伟

最新推荐文章于 2024-09-09 22:01:06 发布

阅读量136

点赞数

分类专栏： LeetCode 文章标签： Magic Squares In Grid 840 leetcode c++

本文链接：https://blog.csdn.net/dangwei_90/article/details/102307075

版权

LeetCode 专栏收录该内容

107 篇文章 0 订阅

订阅专栏

class Solution {
public:
    int numMagicSquaresInside(vector<vector<int>>& grid) {
        if(grid.size() < 3 || grid[0].size() < 3)
        {
            return 0;
        }
        int nCount = 0;
        for(int n = 0; n < grid.size() - 2; n++)
        {
            for(int m = 0; m < grid[0].size() - 2; m++)
            {
                if(grid[n][m] > 9 || grid[n][m] < 1 || grid[n+1][m] > 9 || grid[n+1][m] < 1 || grid[n+2][m] > 9 || grid[n+2][m] < 1
                  || grid[n][m+1] > 9 || grid[n][m+1] < 1 || grid[n+1][m+1] > 9 || grid[n+1][m+1] < 1  || 
                   grid[n+2][m+1] > 9 || grid[n+2][m+1] < 1 || grid[n][m+2] > 9 || grid[n][m+2] < 1 || grid[n+1][m+2] > 9 || 
                   grid[n+1][m+2] < 1  || grid[n+2][m+2] > 9 || grid[n+2][m+2] < 1)
                {
                    continue;
                }
                
                
                int sum1 = grid[n][m] + grid[n][m+1] + grid[n][m+2];
                int sum2 = grid[n+1][m] + grid[n+1][m+1] + grid[n+1][m+2];
                int sum3 = grid[n+2][m] + grid[n+2][m+1] + grid[n+2][m+2];
                int sum4 = grid[n][m] + grid[n+1][m] + grid[n+2][m];
                int sum5 = grid[n][m+1] + grid[n+1][m+1] + grid[n+2][m+1];
                int sum6 = grid[n][m+2] + grid[n+1][m+2] + grid[n+2][m+2];
                int sum7 = grid[n][m] + grid[n+1][m+1] + grid[n+2][m+2];
                int sum8 = grid[n+2][m] + grid[n+1][m+1] + grid[n][m+2];
                if(sum1 == sum2 && sum1 == sum3 && sum1 == sum4 && sum1 == sum5 && sum1 == sum6 && sum1 == sum7 && sum1 == sum8)
                {
                    nCount ++;
                }
            }
        }
        
        return nCount;
    }
};