解数独

1、程序简介

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

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

数字 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] 是一位数字或者 ‘.’
题目数据保证输入数独仅有一个解

2、程序代码

# -*- coding: utf-8 -*-
"""
Created on Fri Dec  3 15:33:29 2021
Function:
@author: 小梁aixj
"""
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 Falsefor n in range(9):if n!=j and board[i][n]==board[i][j]:return Falsefor m in range(i//3*3,i//3*3+3):for n in range(j//3*3,j//3*3+3):if m!=i and n!=j and board[m][n]==board[i][j]:return Falsereturn Truedef 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]=cif isvaild(i,j):if f(a,b,board):return Trueelse: board[i][j]='.'else: board[i][j]='.'return Falsereturn Truef(0,0,board)return board
#%%
s=Solution()
board=[['5','3','.','.','7','.','.','.','.'],['6','.','.','1','9','5','.','.','.'],['.','9','8','.','.','.','.','.','.'],['8','.','.','.','6','.','.','.','3'],['4','.','.','8','.','3','.','.','1'],['7','.','.','.','2','.','.','.','6'],['.','6','.','.','.','.','2','8','.'],['.','.','.','4','1','9','.','.','5'],['.','.','.','.','8','.','.','7','9']]print('按原样输出：')
print(s.solveSudoku(board))
print('格式化输出：')
#格式化输出
a=s.solveSudoku(board)
for x in range(9):for y in range(9):print(a[x][y], end="  ")print()

3、运行结果

解数独 — Python相关推荐

delphi dbgrideh 遍历每一个单元格_用Python解数独[1]：求每个单元格的行值域
目录用Python解数独[0] 用Python解数独[1]:求每个单元格的行值域用Python解数独[2]:求列值域和九宫格值域用Python解数独[3]:求总值域用Python解数独[4]: ...
python deepcopy函数_用Python解数独[6]：递归获得最终答案
目录用Python解数独[0] 用Python解数独[1]:求每个单元格的行值域用Python解数独[2]:求列值域和九宫格值域用Python解数独[3]:求总值域用Python解数独[4]: ...
6个步骤教你用Python解数独！（含实例代码）
前言: 今天为大家带来的内容是:6个步骤教你用Python解数独!(含实例代码),文中通过示例代码介绍的非常详细,对大家的学习或者工作具有一定的参考学习价值,喜欢本文内容的话记得点赞转发收藏不迷路哦! ...
python数独伪代码回溯法_数独的暴力回溯解法和Python GUI
数独起源于18世纪初瑞士数学家欧拉等人研究的拉丁方阵,20世纪70年代,经过美国及日本学者的推广和改良,定名为数独(Sudoku),大致的意思是"独个的数字"或"只出现一 ...
python数独代码_Python 解数独（Sudoku）
闲来有了用python解数独的想法,但由于对复杂些的算法仍是一窍不通,最终算是用简单算法实现了出来. 相关简介: 1.使用的算法很常规,很好理解,有点类似深度优先搜索算法. 2.解常规难度的数独耗时约 ...
用 Python 解数独（Sudoku）
芬兰数学家因卡拉花费3个月时间设计出的世界上迄今难度最大的数独.数独是 9 横 9 竖共有 81 个格子,同时又分为 9 个九宫格.规则很简单:每个空格填入 1~9 任意一个数字,需要保证每个横排和竖 ...
Python + OpenCV + DeepLearning 解数独问题【一、数独的提取】
整个解数独问题可以大致分为3个部分: 从图片中提取出完整的数独[本文的部分] 从数独中提取出数字并传入神经网络进行预测解出数独 [环境] Python:3.8.5 OpenCV:4.5.1 Kera ...
python实现解数独
leetcode题目地址 https://leetcode-cn.com/problems/sudoku-solver/ 1. 数独的规则数字 1-9 在每一行只能出现一次. 数字 1-9 在每一列 ...
用python解数独
本文转自:python解数独--世界最难数独2.3秒完成解数独用的就是深度优先搜索,有几个方面可以优化一下提高速度: 1.把每个空格的可能的点先列举出来,因为深搜是把遍历的值写入sudoku矩阵再判 ...

解数独 — Python

文章目录

解数独

1、程序简介

示例：

输入：

输出：

解释：

提示：

2、程序代码

3、运行结果

解数独 — Python相关推荐

最新文章

热门文章