Leetcode-36. Valid Sudoku

Topic background

Determine if a 9 x 9 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 nine 3 x 3
sub-boxes of the grid must contain the digits 1-9 without repetition.
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.

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 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.

Solution 1

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
		int count = 0;
		for(int i=0;i<board.size();i++){//每行 
			unordered_map<char,int> midchar;
			for(int j=0;j<board[i].size();j++){
				if(board[i][j] != '.'){
					count = midchar[board[i][j]]++;
					if(count>0) 
						return false;
				}
			}
		}
		for(int i=0;i<board.size();i++){//每列 
			unordered_map<char,int> midchar;
			for(int j=0;j<board[i].size();j++){
				if(board[j][i] != '.'){
					count = midchar[board[j][i]]++;
					if(count>0) 
						return false;
				}
			}
		}

		for(int k=1;k<=3;k++){
			unordered_map<char,int> midchar;
			for(int i=(k-1)*3;i<k*3;i++){ //i=0;i<3  456 789
				for(int j=0;j<3;j++){ //j=0;j<3
					if(board[i][j] != '.'){
						count = midchar[board[i][j]]++;
						if(count>0) 
							return false;
					}
				}
			}	
		}
		for(int k=1;k<=3;k++){
			unordered_map<char,int> midchar;
			for(int i=(k-1)*3;i<k*3;i++){ //i=0;i<3  456 789
				for(int j=3;j<6;j++){ //j=0;j<3
					if(board[i][j] != '.'){
						count = midchar[board[i][j]]++;
						if(count>0) 
							return false;
					}
				}
			}	
		}
		for(int k=1;k<=3;k++){
			unordered_map<char,int> midchar;
			for(int i=(k-1)*3;i<k*3;i++){ //i=0;i<3  456 789
				for(int j=6;j<9;j++){ //j=0;j<3
					if(board[i][j] != '.'){
						count = midchar[board[i][j]]++;
						if(count>0) 
							return false;
					}
				}
			}	
		}
		return true;
    }
};