github/leetcode-master
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

替换图片链接

Browse Source
This commit is contained in:
programmercarl
2025-03-17 15:52:23 +08:00
parent 91e7dab72c
commit 86a0208485
216 changed files with 813 additions and 813 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
problems/0037.解数独.md
View File

@@ -18,11 +18,11 @@
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。
空白格用 '.' 表示。
![解数独](https://code-thinking-1253855093.file.myqcloud.com/pics/202011171912586.png)
![解数独](https://file.kamacoder.com/pics/202011171912586.png)
一个数独。
![解数独](https://code-thinking-1253855093.file.myqcloud.com/pics/20201117191340669.png)
![解数独](https://file.kamacoder.com/pics/20201117191340669.png)
答案被标成红色。
@@ -52,7 +52,7 @@
因为这个树形结构太大了，我抽取一部分，如图所示：
![37.解数独](https://code-thinking-1253855093.file.myqcloud.com/pics/2020111720451790-20230310131816104.png)
![37.解数独](https://file.kamacoder.com/pics/2020111720451790-20230310131816104.png)
### 回溯三部曲
@@ -83,7 +83,7 @@ bool backtracking(vector<vector<char>>& board)
* 递归单层搜索逻辑
![37.解数独](https://code-thinking-1253855093.file.myqcloud.com/pics/2020111720451790-20230310131822254.png)
![37.解数独](https://file.kamacoder.com/pics/2020111720451790-20230310131822254.png)
在树形图中可以看出我们需要的是一个二维的递归 （一行一列）