LeetCode #36 - 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.

Note:
A valid Sudoku board (partially filled) is not necessarily solvable. Only the filled cells need to be validated.

合法的数独矩阵是指每一行，每一列，九个方块中1～9最多出现一次，所以可以分别遍历每一行，每一列，九个方块，判断是否有数字重复出现。

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        #判断行
        for(int i=0;i<9;i++)
        {
            vector<bool> visited(10,false);
            for(int j=0;j<9;j++)
            {
                if(board[i][j]>='1'&&board[i][j]<='9')
                {
                    if(visited[board[i][j]-'0']==true) return false;
                    else visited[board[i][j]-'0']=true;
                }
            }
        }
        #判断列
        for(int i=0;i<9;i++)
        {
            vector<bool> visited(10,false);
            for(int j=0;j<9;j++)
            {
                if(board[j][i]>='1'&&board[j][i]<='9')
                {
                    if(visited[board[j][i]-'0']==true) return false;
                    else visited[board[j][i]-'0']=true;
                }
            }
        }
        #判断方块
        for(int i=0;i<9;i+=3)
        {
            for(int j=0;j<9;j+=3)
            {
                vector<bool> visited(10,false);
                for(int k=0;k<9;k++)
                {
                    if(board[i+k/3][j+k%3]>='1'&&board[i+k/3][j+k%3]<='9')
                    {
                        if(visited[board[i+k/3][j+k%3]-'0']==true) return false;
                        else visited[board[i+k/3][j+k%3]-'0']=true;
                    }
                }
            }
        }
        return true;
    }
};