LeetCode36 Valid Sudoku

问题描述：
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 ‘.’.

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.
题源：here；完整代码：here
思路：
判断一个数独游戏矩阵是否有效：横向判断，纵向判断，外加3×3子矩阵判断。注意，在判断一个1×9的vector是否包含重复数字时我的思路是这样的：首先记录逗号个数，然后去掉重复数字，之后比较剩下的长度加上逗号个数与原长度的大小关系：s.size() + dotNum == 10 && dotNum > 0 || s.size() == 9，最后得出结论，代码实现如下：

    bool isUnique(vector<char> s){
        int dotNum = count(s.begin(), s.end(), '.');
        sort(s.begin(), s.end());
        s.erase(unique(s.begin(), s.end()), s.end());

        if (s.size() + dotNum == 10 && dotNum > 0 || s.size() == 9) return true;
        else return false;
    }

    bool isValidSudoku(vector<vector<char>>& board) {
        vector<vector<char>> boardT(9, vector<char>());
        for (int i = 0; i < 9; i++){
            if (!isUnique(board[i])) return false;
            for (int j = 0; j < 9; j++) boardT[j].push_back(board[i][j]);
        }

        for (int i = 0; i < 9; i++){
            if (!isUnique(boardT[i])) return false;
        }

        for (int i = 1; i < 8; i = i + 3){
            for (int j = 1; j < 8; j = j + 3){
                vector<char> tempS;
                for (int m = i - 1; m < i + 2; m++)
                    for (int n = j - 1; n < j + 2; n++)
                        tempS.push_back(board[m][n]);

                if (!isUnique(tempS)) return false;
            }
        }

        return true;
    }