Update 回溯算法详解修订版.md (#653)
Fix a typo from the code. Co-authored-by: labuladong <labuladong@foxmail.com>
This commit is contained in:
parent
a6a439e85c
commit
15d531621a
|
|
@ -89,7 +89,7 @@ PS:**为了简单清晰起见,我们这次讨论的全排列问题不包含
|
|||
|
||||
```java
|
||||
void traverse(TreeNode root) {
|
||||
for (TreeNode child : root.childern)
|
||||
for (TreeNode child : root.children)
|
||||
// 前序遍历需要的操作
|
||||
traverse(child);
|
||||
// 后序遍历需要的操作
|
||||
|
|
@ -539,5 +539,3 @@ var solveNQueens = function (n) {
|
|||
};
|
||||
```
|
||||
|
||||
|
||||
|
||||
|
|
|
|||
Loading…
Reference in New Issue