LeetCode-Hash-36. Valid Sudoku

问题：https://leetcode.com/problems/valid-sudoku/
Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.
The Sudoku board could be partially filled, where empty cells are filled with the character ‘.’.

A partially filled sudoku which is valid.

分析：根据数独游戏的规则，一个9行9列的棋盘，每行每列和指定的9个3*3的小方格都不能有重复的数字，并且数字只能是0-9，需要判断这些规则是否满足。用一个int rows[9][9]来记录行的数字。用一个int col [9][9]来记录列的数字。用一个int gird[3][3][9]来记录网格的数字。

代码：

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        int rows[9][9]={0};
        int col[9][9]={0};
        int gird[3][3][9]={0};
        for(int i=0;i<9;i++){
            for(int j=0;j<9;j++){
                if(board[i][j]=='.')continue;  
                if(board[i][j]<'0' || board[i][j]>'9')return false;  
                int num=board[i][j]-'1';

                if(rows[i][num]==0)
                rows[i][num]+=1;
                else return false;

                if(col[j][num]==0)
                col[j][num]+=1;
                else return false;

                if(gird[i/3][j/3][num]==0)
                gird[i/3][j/3][num]+=1;
                else return false;

            }
        }
        return true;
    }
};