Leetcode36.Valid_Sudoku

最新推荐文章于 2020-10-07 18:00:04 发布

NK_ZZL

最新推荐文章于 2020-10-07 18:00:04 发布

阅读量102

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_42263831/article/details/82721436

版权

LeetCode 专栏收录该内容

78 篇文章 0 订阅

订阅专栏

C++代码：

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        for (auto x : board)
        {
            unordered_map<char, char> hash;
            for (auto y : x)
            {
                if (y == '.')
                    continue;
                if (hash.find(y) != hash.end())
                    return false;
                else
                    hash.insert(make_pair(y, y));
            }
        }
        for (int i = 0; i < 9; i++)
        {
            unordered_map<char, char> hash;
            for (int j = 0; j < 9; j++)
            {
                if (board[j][i] == '.')
                    continue;
                if (hash.find(board[j][i]) != hash.end())
                    return false;
                else
                {
                    hash.insert(make_pair(board[j][i], board[j][i]));
                }
            }
        }
        for (int i = 0; i < 3; i++)
            for (int j = 0; j < 3; j++)
            {
                unordered_map<char, char> hash;
                for (int k = 0; k < 3; k++)
                {
                    for (int l = 0; l < 3; l++)
                    {
                        if (board[3 * i + k][3 * j + l] == '.')
                            continue;
                        if (hash.find(board[3 * i + k][3 * j + l]) != hash.end())
                            return false;
                        else
                        {
                            hash.insert(make_pair(board[3 * i + k][3 * j + l], board[3 * i + k][3 * j + l]));
                        }
                    }
                }
            }
        return true;
    }
};