每日一题170——有效的数独

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

数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。（请参考示例图）
 

注意：

一个有效的数独（部分已被填充）不一定是可解的。
只需要根据以上规则，验证已经填入的数字是否有效即可。
空白格用 '.' 表示。
 

示例 1：

输入：board = 
[["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：

输入：board = 
[["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 存在, 因此这个数独是无效的。
 

提示：

board.length == 9
board[i].length == 9
board[i][j] 是一位数字（1-9）或者 '.'

解题思路：

先验证一行，再验证一列，最后验证3*3数组

代码：

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        int m = board.size(),n = board[0].size();
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                if(board[i][j]<='9' && board[i][j]>='0'){
                    if(isTrue(i,j,board) == 0) return false;
                }
            }
        }
        return true;
    }
    int isTrue(int i,int j,vector<vector<char>>& board){
        int m = board.size(),n = board[0].size();
        
        //判断行
        for(int k=0;k<board[i].size();k++){
            if(board[i][j] == board[i][k] && k!=j) return 0;
        }
        //判断列
        for(int k=0;k<m;k++){
            if(board[k][j] == board[i][j] && k!=i) return 0;
        }
        //判断3*3网格
        int h = (i/3)*3;
        int z = (j/3)*3;

        for(int k1 = h;k1<h+3;k1++){
            for(int k2 = z;k2<z+3;k2++){
                if(board[k1][k2]==board[i][j] && (k1!=i&&k2!=j)) return 0;
            }
        }
        return 1;
    }
};