leetcode 36 有效的數獨

判斷乙個 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 形式的。

from typing import list
class solution:
def isvalidsudoku(self, board: list[list[str]]) -> bool:
def isvalid(ls:list)->bool:
d=dict()
for x in ls:
if x!='.' and x in d:
return false
if x!='.' and x not in d:
d[x]=1
return true
#行for x in board:
if not isvalid(x):
return false
#列for i in range(9):
ls=for j in range(9):
if not isvalid(ls):
return false
for i in range(0,9,3):
for j in range(0,9,3):
ls=for k in range(0,3):
for l in range(0,3):
if not isvalid(ls):
return false
return true

leetcode 36 有效的數獨

LeetCode 36 有效的數獨

LeetCode 36 有效的數獨

leetcode36 有效的數獨

leetcode 36 有效的數獨

LeetCode 36 有效的數獨

LeetCode 36 有效的數獨

leetcode36 有效的數獨

相關推薦