a =[ [0,0,0,0], [0,0,0,0], [0,0,0,0], [0,0,0,0] ] cnt = 0 #解的编号 n = 9 #程序 = 算法 + 数据结构 def valid(x,y,num): for i in range(n): if a[i][y] == num: return False if a[x][i] == num: return False ax,ay = x//3 , y//3 for i in range(3): for j in range(3): nx = ax*3 + i ny = ay*3 + j if a[nx][ny]==num: return False return True def dfs(): global cnt for i in range(n): for j in range(n): if a[i][j]==0: for num in range(1,n+1): if valid(i,j,num): a[i][j]=num dfs() a[i][j]=0 return print("find....") cnt +=1 for row in a: print(row) dfs() print(f"共有{cnt}组解")