回溯算法之有效的数独

LeetCode 36. 有效的数独

判断一个 9x9 的数独是否有效。只需要根据以下规则，验证已经填入的数字是否有效即可。

数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。

上图是一个部分填充的有效的数独。
数独部分空格内已填入了数字，空白格用 ‘.’ 表示。
示例 1:

输入:
[
  ["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"]
]
输出: true

示例 2:

输入:
[
  ["8","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"]
]
输出: false
解释: 除了第一行的第一个数字从 5 改为 8 以外，空格内其他数字均与 示例1 相同。
     但由于位于左上角的 3x3 宫内有两个 8 存在, 因此这个数独是无效的。

说明:
一个有效的数独（部分已被填充）不一定是可解的。
只需要根据以上规则，验证已经填入的数字是否有效即可。
给定数独序列只包含数字 1-9 和字符 ‘.’ 。
给定数独永远是 9x9 形式的。

思路

使用row,col,和子区域block来分别保存元素,如果元素有重复的就返回false,否则返回true即可. 在这里巧用了一下集合. 判断某个元素是否在集合中时间复杂度是O(1),如果使用列表的话就是O(n)了. 其中划分子区域的技巧很巧妙,使用的是 pos = (i//3)*3 + j//3.

代码

class Solution:
    def isValidSudoku(self, board: List[List[str]]) -> bool:
        row = [set() for _ in range(9)]
        col = [set() for _ in range(9)]
        block = [set() for _ in range(9)]
        
        for i in range(9):
            for j in range(9):
                item = board[i][j]
                pos = (i // 3) * 3 + j // 3
                if item != '.':
                    if item not in row[i] and item not in col[j] and item not in block[pos]:
                        row[i].add(item)
                        col[j].add(item)
                        block[pos].add(item)
                    else:
                        return False
        return True

LeetCode 37. 解数独

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

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

数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。
空白格用 ‘.’ 表示。


答案被标成红色。

Note:
给定的数独序列只包含数字 1-9 和字符 ‘.’ 。
你可以假设给定的数独只有唯一解。
给定数独永远是 9x9 形式的。

思路

利用回溯算法，看代码

代码

class Solution:
    def solveSudoku(self, board: List[List[str]]) -> None:
        """
        Do not return anything, modify board in-place instead.
        """
		
		# 判断当前的　s　是否有效
        def isvalid(x, y, s):
            for i in range(9):
                if board[i][y] == s or board[x][i] == s:
                    return False
            
            block_x = (x//3)*3 # 所在block的左上角的横坐标
            block_y = (y//3)*3 # 所在block的左上角的纵坐标

            for i in [0, 1, 2]:　# 遍历block的行和列
                for j in [0, 1, 2]:
                    
                    if board[block_x + i][block_y + j] == s:
                        return False
            return True
        
        def backtrace(curr):
            if curr == 81:　# 遍历到最后一个空位
                return True
            
            x = curr // 9 # 当前位置的横坐标
            y = curr % 9　# 当前位置的纵坐标
            if board[x][y] != '.':　# 如果已经有数字，遍历下一个位置
                return backtrace(curr + 1)
            
            for i in range(1, 10):　# 依次填入１到９数字
                s = str(i)
                if isvalid(x, y, s): # 如果当前填入的数字有效，就先填入
                    board[x][y] = s 
                    if backtrace(curr + 1):　# 如果下一个位置也是有效的，那么当前位置就有效
                        return True
                    board[x][y] = '.'　# 下一个位置无效，撤销之前填入的数字，以便后面重新填入其他的数字
            return False　# 都不合适
        
        backtrace(0)