Leetcode_36. Valid Sudoku

题目：

Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:

Each row must contain the digits 1-9 without repetition.
Each column must contain the digits 1-9 without repetition.
Each of the 9 3x3 sub-boxes of the grid must contain the digits 1-9 without repetition.

A partially filled sudoku which is valid.

The Sudoku board could be partially filled, where empty cells are filled with the character ‘.’.

Example 1:

Input:
[
[“5”,”3”,”.”,”.”,”7”,”.”,”.”,”.”,”.”],
[“6”,”.”,”.”,”1”,”9”,”5”,”.”,”.”,”.”],
[“.”,”9”,”8”,”.”,”.”,”.”,”.”,”6”,”.”],
[“8”,”.”,”.”,”.”,”6”,”.”,”.”,”.”,”3”],
[“4”,”.”,”.”,”8”,”.”,”3”,”.”,”.”,”1”],
[“7”,”.”,”.”,”.”,”2”,”.”,”.”,”.”,”6”],
[“.”,”6”,”.”,”.”,”.”,”.”,”2”,”8”,”.”],
[“.”,”.”,”.”,”4”,”1”,”9”,”.”,”.”,”5”],
[“.”,”.”,”.”,”.”,”8”,”.”,”.”,”7”,”9”]
]
Output: true

Example 2:

Input:
[
[“8”,”3”,”.”,”.”,”7”,”.”,”.”,”.”,”.”],
[“6”,”.”,”.”,”1”,”9”,”5”,”.”,”.”,”.”],
[“.”,”9”,”8”,”.”,”.”,”.”,”.”,”6”,”.”],
[“8”,”.”,”.”,”.”,”6”,”.”,”.”,”.”,”3”],
[“4”,”.”,”.”,”8”,”.”,”3”,”.”,”.”,”1”],
[“7”,”.”,”.”,”.”,”2”,”.”,”.”,”.”,”6”],
[“.”,”6”,”.”,”.”,”.”,”.”,”2”,”8”,”.”],
[“.”,”.”,”.”,”4”,”1”,”9”,”.”,”.”,”5”],
[“.”,”.”,”.”,”.”,”8”,”.”,”.”,”7”,”9”]
]
Output: false
Explanation: Same as Example 1, except with the 5 in the top left corner being
modified to 8. Since there are two 8’s in the top left 3x3 sub-box, it is invalid.

Note:

A Sudoku board (partially filled) could be valid but is not necessarily solvable.
Only the filled cells need to be validated according to the mentioned rules.
The given board contain only digits 1-9 and the character '.'.
The given board size is always 9x9.

题目意思：就是判断是否是一个有效的数独。
只要违反一个条件就不是有效的。
1： 横列不重复出现相同的数字
2： 纵列不重复出现相同的数字
3： 每个小的九宫格不能出现相同的数字

解法：那么只要写两个判断函数即可，一个判断横列纵列，一个判断每个小的九宫格。

代码：

class Solution
{
    public:
      bool Sudoku_isvalid(int row,int col,vector<vector<char> >& board)
    {
        map<char,bool>mp;
        map<char,bool>mp1;
        //mp1.clear();
        for(int i=row;i<row+9;i++)
        {
            mp.clear();
            for(int j=col;j<col+9;j++)
            {
                if(board[i][j]=='.')  continue;
                char ch = board[i][j];
                if(mp[ch])
                {
                    cout<<i<<' '<<j<<endl;
                    return false;
                }
                else
                {
                    mp[ch] = true;
                    //mp1[ch] = true;
                }
            }
        }


        for(int j=col;j<col+9;j++)
        {
            mp.clear();
            for(int i=row;i<row+9;i++)
            {
                if(board[i][j]=='.')  continue;
                char ch = board[i][j];
                if(mp[ch])
                {
                  //  cout<<i<<' '<<j<<endl;
                    return false;
                }
                else  mp[ch] = true;
            }
        }
        return true;
    }


    bool Sudoku_isvalid1(int row,int col,vector<vector<char> >& board)
    {
        map<char,bool>mp;
        mp.clear();
        for(int i=row;i<row+3;i++)
            for(int j=col;j<col+3;j++)
            {
                char ch = board[i][j];
                if(ch=='.') continue;
                if(mp[ch])  return false;
                mp[ch] = true;
            }
        return true;
    }


    bool isValidSudoku(vector<vector<char>>& board)
    {
        if(Sudoku_isvalid(0,0,board)&&Sudoku_isvalid1(0,0,board)&&Sudoku_isvalid1(0,3,board)&&
           Sudoku_isvalid1(0,6,board)&&Sudoku_isvalid1(3,0,board)&&Sudoku_isvalid1(3,3,board)&&
           Sudoku_isvalid1(3,6,board)&&Sudoku_isvalid1(6,0,board)&&Sudoku_isvalid1(6,3,board)&&
           Sudoku_isvalid1(6,6,board))  return true;
        return false;
    }
};