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 digits1-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-9的中数字 且不能重复,并且分成9个以3*3的格式内 如果有数字则必须有1-9的数字 且不能重复故遍历方法如下:
public boolean isValidSudoku(char[][] board) {
for(int i=0;i<board.length;i++) {
for(int j=0;j<board[i].length;j++) {
if(!isValid(board,i,j)) {
return false;
}
}
}
return true;
}
public boolean isValid(char[][] board,int i,int j) {
if(i==0) {
List<Character> t = new ArrayList<>();
for(int tmp=0;tmp<board.length;tmp++) {
if(Character.isDigit(board[tmp][j])) {
if(t.contains(board[tmp][j])) {
return false;
}else {
t.add(board[tmp][j]) ;
}
}
}
}
if(j==0) {
List<Character> t = new ArrayList<>();
for(int tmp=0;tmp<board[i].length;tmp++) {
if(Character.isDigit(board[i][tmp])) {
if(t.contains(board[i][tmp])) {
return false;
}else {
t.add(board[i][tmp]) ;
}
}
}
}
if(i%3 == 0 && j%3 == 0) {
List<Character> t = new ArrayList<>();
for(int k=i;k<i+3;k++) {
for(int l =j;l<j+3;l++) {
if(Character.isDigit(board[k][l])) {
if(t.contains(board[k][l])) {
return false;
}else {
t.add(board[k][l]) ;
}
}
}
}
}
return true;
}