LeetCode - 36 - Valid Sudoku

Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.

The Sudoku board could be partially filled, where empty cells are filled with the character '.'.

A partially filled sudoku which is valid.

Note:
A valid Sudoku board (partially filled) is not necessarily solvable. Only the filled cells need to be validated.

判断一个已经给出的数独是否无效（此题中有效不一定有解）

模拟，判断每一行，每一列，每一个方块。时间复杂度O(3n^2)，空间复杂度O(n)

评论区有个做法，时间复杂度O(n^2)，空间复杂度O(3n^2)

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        int m = board.size();
        int n = board[0].size();
        for (int i = 0; i < m; ++i) {
            unordered_map<char, int> miao;
            for (int j = 0; j < n; ++j) {
                if (board[i][j] == '.') continue;
                if (miao.find(board[i][j]) != miao.end()) return false;
                miao[board[i][j]] = 1;
            }
        }
        for (int j = 0; j < n; ++j) {
            unordered_map<char, int> miao;
            for (int i = 0; i < m; ++i) {
                if (board[i][j] == '.') continue;
                if (miao.find(board[i][j]) != miao.end()) return false;
                miao[board[i][j]] = 1;
            }
        }
        for (int i = 0; i < m; i += 3) {
            for (int j = 0; j < n; j += 3) {
                if (!solve(i, j, board)) return false;
            }
        }
        return true;
    }
    
    bool solve(int c, int l, vector<vector<char>>& board) {
        unordered_map<char, int> miao;
        for (int i = c; i < c + 3; ++i) {
            for (int j = l; j < l + 3; ++j) {
                if (board[i][j] == '.') continue;
                if (miao.find(board[i][j]) != miao.end()) return false;
                miao[board[i][j]] = 1;
            }
        }
        return true;
    }
};

class Solution    //评论区
{
public:
    bool isValidSudoku(vector<vector<char> > &board)
    {
        int used1[9][9] = {0}, used2[9][9] = {0}, used3[9][9] = {0};
        
        for(int i = 0; i < board.size(); ++ i)
            for(int j = 0; j < board[i].size(); ++ j)
                if(board[i][j] != '.')
                {
                    int num = board[i][j] - '0' - 1, k = i / 3 * 3 + j / 3;
                    if(used1[i][num] || used2[j][num] || used3[k][num])
                        return false;
                    used1[i][num] = used2[j][num] = used3[k][num] = 1;
                }
        
        return true;
    }
};