LeetCode OJ-- Valid Sudoku

https://oj.leetcode.com/problems/valid-sudoku/

给出数独的一部分来，验证给出的这一部分是否为 valid

行上无重复的，且是从 ‘1’ 到‘9’

列上无重复的，且是从 ‘1’ 到‘9’

小的3*3 无重复的，且是从 ‘1’ 到‘9’

class Solution {
public:
    bool isValidSudoku(vector<vector<char> > &board) {
        if(board.empty() || board.size() == )
            return false;

        // store the filled to map
        for(int i = ; i < ; i++)
        {
            for(int j = ; j < ; j++)
            {
                int times = ; // record the same 

                // is num
                if(board[i][j] != '.')
                {
                    // from 1 to 9
                    if(!(board[i][j] >= '' && board[i][j] <= ''))
                        return false;

                    // small cube
                    int ith = i / ;
                    int jth = j / ;
                    for(int p = ; p < ; p++)
                    {
                        for(int q = ; q < ; q++)
                        {
                            if(board[ith* + p][jth* + q] == board[i][j])
                                times++;
                        }
                    }

                    for(int p = ; p < ; p++)
                    {
                        if(board[i][j] == board[i][p])
                            times++;
                        if(board[i][j] == board[p][j])
                            times++;
                    }

                }
                if(times > )
                    return false;
            }
        }

        return true;
    }
};