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.

-------------------------------------------------------------------------------------------------------------------------------------

實際就是檢測給定的數獨是否合理，要求行、列、九宮格內數字不重複，採用了比較暴力的算法，遍歷行、列和九宮格，對每個區間的9個數字進行遍歷，在新數組中對象數字下個數+1，如果臨時數組有>1的，證明有重複數字，返回false。最後，返回true。

代碼如下：

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        //檢查每行
        for(int row = 0; row < 9; row++)
        {
            int temp[9] = {0};
            for(int i = 0; i < 9; i++)
            {
                if(board[row][i] == '.')
                    continue;
                else
                {
                    int num = board[row][i] - '0';
                    temp[num-1]++;
                }
            }
            for(int i = 0; i < 9; i++)
                if(temp[i] > 1)
                    return false;
        }
        //檢查每列
         for(int col = 0; col < 9; col++)
        {
            int temp[9] = {0};
            for(int i = 0; i < 9; i++)
            {
                if(board[i][col] == '.')
                    continue;
                else
                {
                    int num = board[i][col] - '0';
                    temp[num-1]++;
                }
            }
            for(int i = 0; i < 9; i++)
                if(temp[i] > 1)
                    return false;
        }
        //檢查每9區域格
        for(int i = 0; i < 9; i +=3)
        {
            for(int j = 0; j < 9; j +=3)
            {
                int temp[9] = {0};
                for(int p = 0; p < 3; p++)
                {
                    for(int q = 0; q < 3; q++)
                    {
                        if(board[i+p][j+q] == '.')
                            continue;
                        else
                        {
                            int num = board[i+p][j+q] - '0';
                            temp[num-1]++;
                        }
                    }
                }
                for(int i = 0; i < 9; i++)
                if(temp[i] > 1)
                    return false;
            }
        }
        return true;
    }
};