840. Magic Squares In Grid*

最新推荐文章于 2024-09-19 19:39:54 发布

珍妮的选择

最新推荐文章于 2024-09-19 19:39:54 发布

阅读量183

点赞数

分类专栏： LeetCode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/Eric_1993/article/details/103797013

版权

LeetCode 专栏收录该内容

416 篇文章 4 订阅

订阅专栏

840. Magic Squares In Grid*

https://leetcode.com/problems/magic-squares-in-grid/

题目描述

这题没啥意思, 就用暴力求解. 看我的 Ugly 代码.

C++ 实现 1

class Solution {
public:
    int numMagicSquaresInside(vector<vector<int>>& grid) {
        int m = grid.size(), n = grid[0].size();
        int res = 0;
        vector<int> nums = {1, 2, 3, 4, 5, 6, 7, 8, 9};
        for (int i = 1; i < m - 1; ++ i) {
            for (int j = 1; j < n - 1; ++ j) {
                if (grid[i][j] != 5) continue;
                auto a = grid[i + 1][j - 1] + grid[i + 1][j] + grid[i + 1][j + 1];
                auto b = grid[i][j - 1] + grid[i][j] + grid[i][j + 1];
                auto c = grid[i - 1][j - 1] + grid[i - 1][j] + grid[i - 1][j + 1];
                auto d = grid[i + 1][j - 1] + grid[i][j - 1] + grid[i - 1][j - 1];
                auto e = grid[i + 1][j] + grid[i][j] + grid[i - 1][j];
                auto f = grid[i + 1][j + 1] + grid[i][j + 1] + grid[i - 1][j + 1];
                auto g = grid[i + 1][j - 1] + grid[i][j] + grid[i - 1][j + 1];
                auto h = grid[i - 1][j - 1] + grid[i][j] + grid[i + 1][j + 1];
                vector<int> cur = {
                    grid[i + 1][j - 1], grid[i + 1][j], grid[i + 1][j + 1],
                    grid[i][j - 1],     grid[i][j],     grid[i][j + 1],
                    grid[i - 1][j - 1], grid[i - 1][j], grid[i- 1][j + 1]
                };
                std::sort(cur.begin(), cur.end());
                if (cur == nums && a == b && b == c && c == d && d == f && f == g && h == h) res ++;
            }
        }
        return res;
    }
};