LeetCode 36. Valid Sudoku C++ (Hash Table)

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

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

A partially filled sudoku which is valid.

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

判断一个 9x9 的数独是否有效。只需要根据以下规则，验证已经填入的数字是否有效即可。

数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。

上图是一个部分填充的有效的数独。

数独部分空格内已填入了数字，空白格用 ‘.’ 表示。

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.
说明:

一个有效的数独（部分已被填充）不一定是可解的。
只需要根据以上规则，验证已经填入的数字是否有效即可。
给定数独序列只包含数字 1-9 和字符 ‘.’ 。
给定数独永远是 9x9 形式的。]

C++

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        int row[9][9] = {0},col[9][9] = {0},boxes[9][9] = {0};//第二个[]储存的是数字1-9。 
        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(	row[i][num] || col[j][num] || boxes[k][num]) return false;//之前出现过了,表示重复,输出false 
					row[i][num] = col[j][num] = boxes[k][num] = 1;//表示出现过了
				}
			}
		}
		return true;
    }
};

分析：建立3种数组，row，com和boxes，分别查看每行，每列，每个九宫格数字的重复情况。
我们知道是第i行，第j列，第 (i/3)*3 + j/3个九宫格。i/3的目的是只保留i/3的整数部分

第一个[ ]表示是第几个数组，第二个[ ]表示数字，比如row[2][8]表示第3个列数组里，数字9的存放情况。
1表示存放过了，之后遍历到如果发现1说明数字重复，输出false。
全部迭代完成没有异常情况则说明数独有效，输出true.