LeetCode:有效的数独＜c++＞

题目内容：

判断一个 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

思路：先遍历行，再遍历列，其次再判断每个九宫格

九宫格的思路

class Solution {
public:

    bool isValidSudoku(vector<vector<char>>& board) 
    {
        int row[9][10]={0};//初始化为0
        int col[9][10]={0};
        int box[9][10]={0};
        for(int i=0;i<9;i++)//i代表行数
        {    for(int j=0;j<9;j++)//j代表列数
            {
                if(board[i][j]=='.') continue;
                int curNumber=board[i][j]-'0';
                //如果遇到已经遍历过的数，就直接返回false
                if(row[i][curNumber]) return false;//判断行
                if(col[j][curNumber]) return  false;//判断列
                if(box[j/3+(i/3)*3][curNumber]) return false;//判断九宫格
                //第一次遍历到这个数curNumber,就直接给其赋值为1
                row[i][curNumber] = 1;
                col[j][curNumber] = 1;
                box[j/3+(i/3)*3][curNumber] = 1;//九个九宫格判断
            }
        }
        return true;

    }

};