问题:
编写一个程序,通过填充空格来解决数独问题。
数独的解法需 遵循如下规则:
数字 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"]]
输出:
[["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","1"],
["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"]]
解释:输入的数独如上图所示,唯一有效的解决方案如下所示:
提示:
board.length == 9
board[i].length == 9
board[i][j] 是一位数字或者 '.'
题目数据 保证 输入数独仅有一个解
以下程序实现了这一功能,请你填补空白处内容:
class Solution(object):
def solveSudoku(self, board):
def isvaild(i,j):
for m in range(9):
if m!=i and board[m][j]==board[i][j]:
return False
for n in range(9):
if n!=j and board[i][n]==board[i][j]:
return False
______________________;
return True
def f(a,b,board):
for i in range(a,9):
for j in range(b,9):
if board[i][j]=='.':
for c in '123456789':
board[i][j]=c
if isvaild(i,j):
if f(a,b,board):return True
else: board[i][j] = '.'
else:board[i][j] = '.'
return False
return True
f(0,0,board)
return board
# %%
s = Solution()
board = [["5","3",".",".","7",".",".",".","."],["6",".",".","1","9","5",".",".","."],[".","9","8",".",".",".",".","6","."],["8",".",".",".","6",".",".",".","3"],["4",".",".","8",".","3",".",".","1"],["7",".",".",".","2",".",".",".","6"],[".","6",".",".",".",".","2","8"
解答思路:
以下是填补空白处后的完整代码:
class Solution(object):
def solveSudoku(self, board):
def isvaild(i, j):
for m in range(9):
if m!= i and board[m][j] == board[i][j]:
return False
for n in range(9):
if n!= j and board[i][n] == board[i][j]:
return False
start_row = i // 3 * 3
start_col = j // 3 * 3
for m in range(start_row, start_row + 3):
for n in range(start_col, start_col + 3):
if (m!= i or n!= j) and board[m][n] == board[i][j]:
return False
return True
def f(a, b, board):
for i in range(a, 9):
for j in range(b, 9):
if board[i][j] == '.':
for c in '123456789':
board[i][j] = c
if isvaild(i, j):
if f(a, b, board):
return True
else:
board[i][j] = '.'
else:
board[i][j] = '.'
return False
return True
f(0, 0, board)
return board
在 'isvaild' 函数中,我们需要检查当前数字在所在的 3x3 宫内是否重复。我们通过计算当前单元格所在的 3x3 宫的左上角坐标 'start_row' 和 'start_col',然后遍历这个 3x3 宫内的所有单元格进行检查。
(文章为作者在学习java过程中的一些个人体会总结和借鉴,如有不当、错误的地方,请各位大佬批评指正,定当努力改正,如有侵权请联系作者删帖。)