840. Magic Squares In Grid*

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;
    }
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值