判断一个 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 形式的。
官方题解讲得很清楚了,主要思路就是对每一行每一列和每一块都建立字典,然后一次遍历,根据是否有重复的进行判断:
class Solution:
def isValidSudoku(self, board):
"""
:type board: List[List[str]]
:rtype: bool
"""
x_dict = [{} for x in range(9)] # 9行
y_dict = [{} for y in range(9)] # 9列
box_dict = [{} for box in range(9)] # 从左到右从上到下9块
for i in range(9):
for j in range(9):
try:
num = int(board[i][j])
box_index = (i // 3) * 3 + j // 3
x_dict[i][num] = x_dict[i].get(num, 0) + 1
if x_dict[i][num] > 1:
return False
y_dict[j][num] = y_dict[j].get(num, 0) + 1
if y_dict[j][num] > 1:
return False
box_dict[box_index][num] = box_dict[box_index].get(num, 0) + 1
if box_dict[box_index][num] > 1:
return False
except ValueError:
pass
return True
优化一下:
class Solution:
def isValidSudoku(self, board):
"""
:type board: List[List[str]]
:rtype: bool
"""
x_list = [[] for x in range(9)] # 9行
y_list = [[] for y in range(9)] # 9列
box_list = [[] for box in range(9)] # 从左到右从上到下9块
for i in range(9):
for j in range(9):
try:
num = int(board[i][j])
box_index = (i // 3) * 3 + j // 3
if num in x_list[i] + y_list[j] + box_list[box_index]:
return False # 先判断后添加
x_list[i].append(num)
y_list[j].append(num)
box_list[box_index].append(num)
except ValueError:
pass
return True