leetcode学习：37.解数独

37.解数独

题目描述

编写一个程序，通过填充空格来解决数独问题。

数独的解法需 遵循如下规则：

数字 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”]]
解释：输入的数独如上图所示，唯一有效的解决方案如下所示：

思路

用rows、columns、blocks判断当前位置是否能放某个数字，用一个栈用来回溯。

代码

// A code block
class Solution:
    def solveSudoku(self, board: List[List[str]]) -> None:
        """
        Do not return anything, modify board in-place instead.
        """
        li = ['1', '2', '3', '4', '5', '6', '7', '8', '9']

        def Push(i, j, stark, index, board):
            for item in li[index:]:
                if item not in rows[i] and item not in columns[j] and item not in blocks[i // 3 * 3 + j // 3]:
                    rows[i].append(item)
                    columns[j].append(item)
                    blocks[i // 3 * 3 + j // 3].append(item)
                    stark.append([i, j, item])
                    board[i][j] = item
                    return True
            return False

        rows = [[] for i in range(len(board))]
        columns = [[] for i in range(len(board))]
        blocks = [[] for i in range(len(board))]
        for i in range(len(board)):
            for j in range(len(board[0])):
                now = board[i][j]
                if now != '.':
                    rows[i].append(now)
                    columns[j].append(now)
                    blocks[i // 3 * 3 + j // 3].append(now)
        stark = []
        i = 0
        j = 0 
        flag = False
        for i_new in range(len(board)):
            for j_new in range(len(board[0])):
                if board[i_new][j_new] == '.':
                    i = i_new
                    j = j_new
                    flag =True
                    break
            if flag:
                break
        while flag:
            #print(i, j)
            if Push(i, j, stark, 0, board) == False:
                while stark:
                    tmp = stark.pop()
                    rows[tmp[0]].remove(tmp[2])
                    columns[tmp[1]].remove(tmp[2])
                    blocks[tmp[0] // 3 * 3 + tmp[1] // 3].remove(tmp[2])
                    board[tmp[0]][tmp[1]] = '.'

                    i = tmp[0]
                    j = tmp[1]
                    if tmp[2] != '9':
                        if Push(tmp[0], tmp[1], stark, int(tmp[2]), board):
                            break
            flag = False
            #print(board)
            for i_new in range(i, len(board)):
                for j_new in range(0, len(board[0])):
                    #print(i_new, j_new)
                    if board[i_new][j_new] == '.':
                        flag = True
                        i = i_new
                        j = j_new
                        break
                if flag:
                    break

执行效率

执行用时：
224 ms, 在所有 Python3 提交中击败了44.54%的用户
内存消耗：
15.1 MB, 在所有 Python3 提交中击败了49.84%的用户

题目来源

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/sudoku-solver
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。