题目
判断一个 9x9 的数独是否有效。只需要根据以下规则,验证已经填入的数字是否有效即可。
- 数字
1-9
在每一行只能出现一次。 - 数字
1-9
在每一列只能出现一次。 - 数字
1-9
在每一个以粗实线分隔的3x3
宫内只能出现一次。
上图是一个部分填充的有效的数独。
数独部分空格内已填入了数字,空白格用 '.'
表示。
示例 1:
输入: [ ["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"] ] 输出: true
示例 2:
输入: [ ["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"] ] 输出: false 解释: 除了第一行的第一个数字从 5 改为 8 以外,空格内其他数字均与 示例1 相同。 但由于位于左上角的 3x3 宫内有两个 8 存在, 因此这个数独是无效的。
说明:
- 一个有效的数独(部分已被填充)不一定是可解的。
- 只需要根据以上规则,验证已经填入的数字是否有效即可。
- 给定数独序列只包含数字
1-9
和字符'.'
。 - 给定数独永远是
9x9
形式的。
python语言代码实现:
class Solution:
def isValidSudoku(self, board):
"""
:type board: List[List[str]]
:rtype: bool
"""
for i in range(0,9):
row = [0] * 9
col = [0] * 9
cube = [0] * 9
for j in range(0,9):
if board[i][j] !='.':
if row[int(board[i][j])-1] == 1:
print(1)
return False
else:
row[int(board[i][j])-1] = 1
if board[j][i] !='.':
if col[int (board[j][i])-1] == 1:
print(2)
return False
else:
col[int (board[j][i])-1] = 1
cubeX = int (3*(i//3)+j//3)
cubeY = int (3 * (i % 3) + j % 3)
if board[cubeX][cubeY] !='.':
if cube[int(board[cubeX][cubeY])-1] == 1:
print(cubeX)
print(cubeY)
print(int(board[cubeX][cubeY])-1)
return False
else:
cube[int (board[cubeX][cubeY])-1] = 1
return True
Java语言代码实现:
class Solution {
public boolean isValidSudoku(char[][] board) {
//位图法
//维护三个数组:行,列、宫
for(int i=0; i<9; i++){
int[] row = new int[9];
int[] col = new int[9];
int[] cube = new int[9];
for (int j=0; j<9; j++){
if(board[i][j]!='.'){
if(row[board[i][j] - '1'] ==1){
return false;
}else {
row[board[i][j] - '1'] =1;
}
}
if(board[j][i] != '.'){
if(col[board[j][i] - '1'] == 1){
return false;
}else{
col[board[j][i] - '1'] = 1;
}
}
//每一宫内行列的变换
int cubeX = 3 * (i/3) + j/3;
int cubeY = 3 * (i%3) + j%3;
if(board[cubeX][cubeY]!='.'){
if (cube[board[cubeX][cubeY] - '1'] == 1){
return false;
}else{
cube[board[cubeX][cubeY] - '1'] = 1;
}
}
}
}
return true;
}
}