python 数独_Python中的数独检查器

我正在尝试用python创建一个数独检查器：ill_formed = [[5,3,4,6,7,8,9,1,2],

[6,7,2,1,9,5,3,4,8],

[1,9,8,3,4,2,5,6,7],

[8,5,9,7,6,1,4,2,3],

[4,2,6,8,5,3,7,9], #

[7,1,3,9,2,4,8,5,6],

[9,6,1,5,3,7,2,8,4],

[2,8,7,4,1,9,6,3,5],

[3,4,5,2,8,6,1,7,9]]

easy = [[2,9,0,0,0,0,0,7,0],

[3,0,6,0,0,8,4,0,0],

[8,0,0,0,4,0,0,0,2],

[0,2,0,0,3,1,0,0,7],

[0,0,0,0,8,0,0,0,0],

[1,0,0,9,5,0,0,6,0],

[7,0,0,0,9,0,0,0,1],

[0,0,1,2,0,0,3,0,6],

[0,3,0,0,0,0,0,5,9]]

我期待这样的输入-一个由9个列表组成的列表。零表示用户尚未填写的数字。它们可以在一行、一列或3x3中多次出现。def check_sudoku(grid):

if len(grid) == 9:

numsinrow = 0

for i in range(9):

if len(grid[i]) == 9:

numsinrow += 1

if numsinrow == 9:

for i in range(9):

rowoccurence = [0,0,0,0,0,0,0,0,0,0]

f