leetcode题：36. 有效的数独（中等）

一、题目描述：36. 有效的数独（中等）

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

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

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

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

示例 1:

输入:
[
  ["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"]
]
输出: true
示例 2:

输入:
[
  ["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"]
]
输出: false
解释: 除了第一行的第一个数字从 5 改为 8 以外，空格内其他数字均与 示例1 相同。
     但由于位于左上角的 3x3 宫内有两个 8 存在, 因此这个数独是无效的。
说明:

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

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/valid-sudoku
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

二、解题思路

题目不需要判断数独是否可解，所有一次遍历，3组set分别保存行row、列col、3*3正方形inner的数组是否重复就可以。注意是3*3的正方形就是建立一组3*3的数组inner，数组元素就是set。然后遍历数独表i，j分别映射成i/3，j/3对应inner的行和列的set。

三、代码

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        vector<set<char>> col(board.size(),set<char>());
        vector<set<char>> row(board.size(),set<char>());
        vector<vector<set<char>>> inner(board.size()/3,vector<set<char>>(board.size()/3,set<char>()));
        for(int i = 0; i < board.size(); i ++)
        {
            for(int j = 0; j < board[i].size(); j ++)
            {
                if(board[i][j] == '.')
                {
                    continue;
                }
                if(col[j].count(board[i][j]) > 0)
                    return false;
                if(row[i].count(board[i][j]) > 0)
                    return false;
                if(inner[i/3][j/3].count(board[i][j]) > 0)
                    return false;
                col[j].insert(board[i][j]);
                row[i].insert(board[i][j]);
                inner[i/3][j/3].insert(board[i][j]);
            }
        }
        return true;
    }
};