Leetcode 36. Effective Sudoku (yes, once)

Please judge a 9 x 9 Is the Sudoku effective . It only needs According to the following rules , Verify that the numbers you have filled are valid .

1. Numbers 1-9 Only once in a row .
2. Numbers 1-9 It can only appear once in each column .
3. Numbers 1-9 Separated by thick solid lines in each 3x3 Only once in the palace .（ Please refer to the example figure ）

Be careful ：

• An effective Sudoku （ Part has been filled in ） Not necessarily solvable .
• Just follow the above rules , Verify that the numbers you have filled are valid .
• Blank space ‘.’ Express .

Example 1：

 Input ：board = 
[["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 ：board = 
[["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
 explain ： Except for the first number in the first line from  5  Change it to  8  outside , The other numbers in the space are the same as   Example 1  identical .  But because of the  3x3  There are two in the palace  8  There is ,  So this Sudoku is invalid .
 

Tips ：

• board.length == 9
• board[i].length == 9
• board[i][j] It's a number （1-9） perhaps ‘.’

Main idea ：map
Code:

class Solution {
    
public:
    bool isValidSudoku(vector<vector<char>>& board) {
    
        map<char,int>mymap;
        pair<map<char, int>::iterator, bool> ret;
        for(int j=0;j<board[0].size();j++)
        {
    
            for(int i=0;i<board.size();i++)
            {
    
                vector<char>sub=board[i];
                if(board[i][j]=='.')
                    continue;
                ret=mymap.insert(pair<char,int>(board[i][j],0));
                if(!ret.second)
                    return false;
                cout<<board[i][j]<<endl;
            }
            mymap.clear();
        }
        mymap.clear();
        for(int i=0;i<board.size();i++)
        {
    
            vector<char>sub=board[i];
            for(int j=0;j<sub.size();j++)
            {
    
                if(sub[j]=='.')
                    continue;
                ret=mymap.insert(pair<char,int>(sub[j],0));
                if(!ret.second)
                    return false;
            }
            mymap.clear();
        }
        mymap.clear();
        cout<<"++++"<<endl;
        int row=0;
        int col=0;
        do
        {
    
            
            for(int i=row;i<row+3;i++)
            {
    
                vector<char>sub=board[i];
                for(int j=col;j<col+3;j++)
                {
    
                    if(sub[j]=='.')
                        continue;
                    ret=mymap.insert(pair<char,int>(sub[j],0));
                    if(!ret.second)
                        return false;
                }
            }
            col+=3;
            mymap.clear();
            if(col==9)
            {
    
                col=0;
                row+=3;
                cout<<"row="<<row<<endl;
            }
            if(row==9)
            {
    
                break;
            }
        }while(1);
        
        return true;
        
    }
};