36.有效的数独
题目描述
请你判断一个 9x9 的数独是否有效。只需要 根据以下规则 ,验证已经填入的数字是否有效即可。
数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。(请参考示例图)
数独部分空格内已填入了数字,空白格用 ‘.’ 表示。
注意:
一个有效的数独(部分已被填充)不一定是可解的。
只需要根据以上规则,验证已经填入的数字是否有效即可。
示例
输入: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”]]
输出:true
思路
行、列、块各一个二维数组记录情况,块的数字为 i//3*3+j//3
代码
class Solution:
def isValidSudoku(self, board: List[List[str]]) -> bool:
rows = [[] for i in range(len(board))]
columns = [[] for i in range(len(board))]
blocks = [[] for i in range(len(board))]
for i in range(len(board)):
for j in range(len(board[0])):
##print(i,j)
now = board[i][j]
if now != '.':
if now in rows[i]:
##print(1)
return False
else:
rows[i].append(now)
##print(i,rows[i],rows[i+1])
if now in columns[j]:
##print(2)
return False
else:
columns[j].append(now)
if now in blocks[i // 3 * 3+ j // 3]:
##print(3)
return False
else:
blocks[i // 3 * 3 + j // 3].append(now)
return True
运行结果
执行用时:
40 ms, 在所有 Python3 提交中击败了98.41%的用户
内存消耗:
14.8 MB, 在所有 Python3 提交中击败了86.85%的用户
题目来源
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/valid-sudoku
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。