algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-25 09:42:16 +08:00
Code Issues Packages Projects Releases Wiki Activity

“颗” -> “棵”

Browse Source
This commit is contained in:
bqlin
2021-12-25 12:24:02 +08:00
parent 96f70a46a4
commit 898330147c
29 changed files with 51 additions and 51 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0077.组合.md
View File

@ -328,7 +328,7 @@ public:
本篇我们准对求组合问题的回溯法代码做了剪枝优化，这个优化如果不画图的话，其实不好理解，也不好讲清楚。
所以我依然是把整个回溯过程抽象为一颗树形结构，然后可以直观的看出，剪枝究竟是剪的哪里。
所以我依然是把整个回溯过程抽象为一棵树形结构，然后可以直观的看出，剪枝究竟是剪的哪里。