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

Merge pull request #819 from casnz1601/patch-3

Browse Source 
Update 二叉树中递归带着回溯.md
This commit is contained in:
程序员Carl
2021-10-06 16:22:03 +08:00
committed by GitHub
parent 54cd09d3c6 7b6fd76129
commit b066b17a69
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
problems/二叉树中递归带着回溯.md
View File

@ -145,22 +145,22 @@ if (cur->right) {
} }
``` ```
此时就没有回溯了，这个代码就是通过不了的了。 因为在递归右子树之前需要还原path，所以在左子树递归后必须为了右子树而进行回溯操作。而只右子树自己不添加回溯也可以成功AC。
如果想把回溯加上，就要 在上面代码的基础上，加上回溯，就可以AC了。 因此，在上面代码的基础上，再加上左右子树的回溯代码，就可以AC了。
```CPP ```CPP
if (cur->left) { if (cur->left) {
path += "->"; path += "->";
traversal(cur->left, path, result); // 左 traversal(cur->left, path, result); // 左
path.pop_back(); // 回溯 path.pop_back(); // 回溯，抛掉val
path.pop_back(); path.pop_back(); // 回溯，抛掉->
} }
if (cur->right) { if (cur->right) {
path += "->"; path += "->";
traversal(cur->right, path, result); // 右 traversal(cur->right, path, result); // 右
path.pop_back(); // 回溯 path.pop_back(); // 回溯（非必要）
path.pop_back(); path.pop_back();
} }
``` ```