36. Valid Sudoku**

36. Valid Sudoku**

https://leetcode.com/problems/valid-sudoku/

题目描述

Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:

1. Each row must contain the digits 1-9 without repetition.
2. Each column must contain the digits 1-9 without repetition.
3. Each of the 9 3x3 sub-boxes of the grid must contain the digits 1-9 without repetition.

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

Example 1:

Input:
[
  ["5","3",".",".","7",".",".",".","."],
  ["6",".",".","1","9","5",".",".","."],
  [".","9","8",".",".",".",".","6","."],
  ["8",".",".",".","6",".",".",".","3"],
  ["4",".",".","8",".","3",".",".","1"],
  ["7",".",".",".","2",".",".",".","6"],
  [".","6",".",".",".",".","2","8","."],
  [".",".",".","4","1","9",".",".","5"],
  [".",".",".",".","8",".",".","7","9"]
]
Output: true

Example 2:

Input:
[
  ["8","3",".",".","7",".",".",".","."],
  ["6",".",".","1","9","5",".",".","."],
  [".","9","8",".",".",".",".","6","."],
  ["8",".",".",".","6",".",".",".","3"],
  ["4",".",".","8",".","3",".",".","1"],
  ["7",".",".",".","2",".",".",".","6"],
  [".","6",".",".",".",".","2","8","."],
  [".",".",".","4","1","9",".",".","5"],
  [".",".",".",".","8",".",".","7","9"]
]
Output: false
Explanation: Same as Example 1, except with the 5 in the top left corner being 
    modified to 8. Since there are two 8's in the top left 3x3 sub-box, it is invalid.

Note:

• A Sudoku board (partially filled) could be valid but is not necessarily solvable.
• Only the filled cells need to be validated according to the mentioned rules.
• The given board contain only digits 1-9 and the character '.'.
• The given board size is always 9x9.

C++ 实现 1

题目中的数独需要判断每一行, 每一列, 每一个 3x3 子块中没有重复数字. 由于棋盘大小限定了 9x9, 那么直接用 row, col, partial 三个哈希表保存行列以及 3x3 子块的所有状态. row[i] 表示第 i 行的状态. 而对于 3x3 子块, 一个数独中有 9 个, 使用 idx = (i / 3) * 3 + (j / 3) 获取到当前访问的元素 board[i][j] 到底处在第几个子块.

class Solution {
private:
    bool check(unordered_map<int, unordered_set<char>> &record, int idx, const char &s) {
        if (s == '.') return false;
        if (!record.count(idx)) return false;
        return record[idx].count(s);
    }
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        unordered_map<int, unordered_set<char>> row, col, partial;
        for (int i = 0; i < 9; ++ i) {
            for (int j = 0; j < 9; ++ j) {
                if (board[i][j] == '.') continue;
                if (check(row, i, board[i][j])) return false;
                else row[i].insert(board[i][j]);
                if (check(col, j, board[i][j])) return false;
                else col[j].insert(board[i][j]);
                auto idx = (i / 3) * 3 + (j / 3);
                if (check(partial, idx, board[i][j])) return false;
                else partial[idx].insert(board[i][j]);
            }
        }
        return true;
    }
};