leetcode: 37. Sudoku Solver

最新推荐文章于 2025-09-06 17:22:57 发布

JNingWei

最新推荐文章于 2025-09-06 17:22:57 发布

阅读量348

点赞数 1

CC 4.0 BY-SA版权

分类专栏： LeetCode-Python 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/JNingWei/article/details/78526599

LeetCode-Python 专栏收录该内容

134 篇文章

订阅专栏

本文介绍了一个使用Python编写的程序，该程序能够解决数独谜题。通过递归回溯算法填充空格，并验证每一步操作的有效性，确保最终得到唯一正确答案。文章附带了完整的代码实现及运行示例。

Problem

# Write a program to solve a Sudoku puzzle by filling the empty cells.
# 
# Empty cells are indicated by the character '.'.
# 
# You may assume that there will be only one unique solution.

这里写图片描述
A sudoku puzzle…

这里写图片描述
…and its solution numbers marked in red.

AC

class Solution():
    def solveSudoku(self, board):
        def solver(board):
            for i in range(9):
                for j in range(9):
                    if board[i][j] == ".":
                        for k in range(1, 10):
                            board[i][j] = str(k)
                            if isValid(board, i, j) and solver(board):
                                return True
                            board[i][j] = "."
                        return False
            return True

        def isValid(board, x, y):
            for i in range(9):
                if (i != x and board[i][y] == board[x][y]) or (i != y and board[x][i] == board[x][y]):
                    return False
            for i in range((x//3)*3, (x//3)*3+3):
                for j in range((y//3)*3, (y//3)*3+3):
                    if (i != x or j != y) and board[i][j] == board[x][y]:
                        return False
            return True

        solver(board)


if __name__ == '__main__':
    board = [[".",".","9","7","4","8",".",".","."],
             ["7",".",".",".",".",".",".",".","."],
             [".","2",".","1",".","9",".",".","."],
             [".",".","7",".",".",".","2","4","."],
             [".","6","4",".","1",".","5","9","."],
             [".","9","8",".",".",".","3",".","."],
             [".",".",".","8",".","3",".","2","."],
             [".",".",".",".",".",".",".",".","6"],
             [".",".",".","2","7","5","9",".","."]]
    Solution().solveSudoku(board)
    assert board == [["5","1","9","7","4","8","6","3","2"],
                     ["7","8","3","6","5","2","4","1","9"],
                     ["4","2","6","1","3","9","8","7","5"],
                     ["3","5","7","9","8","6","2","4","1"],
                     ["2","6","4","3","1","7","5","9","8"],
                     ["1","9","8","5","2","4","3","6","7"],
                     ["9","7","5","8","6","3","1","2","4"],
                     ["8","3","2","4","9","1","7","5","6"],
                     ["6","4","1","2","7","5","9","8","3"]]