遍历,每到一个点,判断该行该列的数是否有与其相同的,由于行比它小以及列比他它小的位置已经比较过了,所以可以直接跳过。
然后还要比较该点位于的九宫格是否符合条件。
class Solution {
public:
bool isValidSudoku(vector<vector<char> > &board) {
for(int i = 0; i < board.size(); i++){
for(int j = 0; j < board[i].size(); j++){
if(board[i][j] == '.' || judge(board, i, j))
continue;
else return false;
}
}
return true;
}
bool judge(vector<vector<char> > &board, int i, int j){
int r = i, c = j;
int row = board.size(), col = board.size();
while(++r < row){
if(board[i][j] == board[r][j]){
return false;
}
}
while(++c < col){
if(board[i][j] == board[i][c]){
return false;
}
}
int r1 = i/3 * 3, r2 = (i/3+1) * 3, c1 = j/3 * 3, c2 = (j/3+1) *3;
for(int k = r1; k < r2; k++){
for(int t = c1; t < c2; t++){
if(board[i][j] == board[k][t] && k != i && t != j)
return false;
}
}
return true;
}
};