LeetCode 37 解数独
实习之后好久没做了,做了几道题也没有些记录。之前做的就不补了哈哈
一、题目描述
输入已经保证了是肯定具有唯一解的数独题
二、解法思路
- 数据预处理,直接操作board太麻烦了,判断也过于麻烦。所以从中抽取三个需要集中判断的字段。每一行缺失的数字,每一列缺失的数字,每一块(3*3)块缺失的数字。
- 一开始以为会一直存在有一个位置只会有一个可选的数字,结果发现不是
- 使用类似于八皇后的回溯法来解决
三、代码:
class Solution:
def union(self, row_i, col_j, block_n):
return list(set(row_i).intersection(set(col_j)).intersection(set(block_n)))
def solveSudoku(self, board):
row = [[str(i) for i in range(1, 10)] for j in range(9)]
col = [[str(i) for i in range(1, 10)] for j in range(9)]
block = [[str(i) for i in range(1, 10)] for j in range(9)]
has_to_fix = []
# 进行初始化
for i in range(9):
for j in range(9):
if board[i][j] == ".":
has_to_fix.append((i, j, (i // 3) * 3 + j // 3))
else:
row[i].remove(board[i][j])
col[j].remove(board[i][j])
block[(i // 3) * 3 + j // 3].remove(board[i][j])
# 开始运行八皇后
self.run(row, col, block, has_to_fix, board)
print(board)
# 类似于八皇后开始解决
def run(self, row, col, block, has_to_fix, board):
i, j, n = has_to_fix.pop()
condition = self.union(row[i], col[j], block[n])
if len(condition) == 0:
has_to_fix.append((i,j,n))
return False
else:
for choose in condition:
board[i][j] = choose
row[i].remove(choose)
col[j].remove(choose)
block[n].remove(choose)
# 所有的都已经确定了
if len(has_to_fix) == 0:
return True
# 还有没确定的
if self.run(row, col, block, has_to_fix, board):
return True
else:
# 不成功
board[i][j] = "."
row[i].append(choose)
col[j].append(choose)
block[n].append(choose)
has_to_fix.append((i, j, n))
return False
so = Solution()
so.solveSudoku([[".", ".", "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", ".", "."]])