LeetCode 有效的数独

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        vector<vector<int>> rows(9,vector<int>(9,0));
        vector<vector<int>> cols(9,vector<int>(9,0));
        vector<vector<int>> boxes(9,vector<int>(9,0));
        for(int i=0;i<9;i++)
        {
            for(int j=0;j<9;j++)
            {
                int idx=i/3+(j/3)*3;
                if(board[i][j]=='.')
                continue;
                else
                {
                    int val=board[i][j]-'1';
                    if(rows[i][val]==0&&cols[j][val]==0&&boxes[idx][val]==0)
                    {
                        rows[i][val]=1;
                        cols[j][val]=1;
                        boxes[idx][val]=1;
                    }
                    else{
                        return false;
                    }

                }
            }
        }
        return true;
    }
};