algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-11 04:54:51 +08:00
Code Issues Packages Projects Releases Wiki Activity

修正Markdown代码块语法

Browse Source
This commit is contained in:
youngyangyang04
2021-05-16 20:06:05 +08:00
parent 695f08672d
commit ad538d8e48
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/0257.二叉树的所有路径.md
View File

@ -77,7 +77,7 @@ if (cur->left == NULL && cur->right == NULL) {
这里我们先使用vector<int>结构的path容器来记录路径，那么终止处理逻辑如下： 这里我们先使用vector<int>结构的path容器来记录路径，那么终止处理逻辑如下：
``` ```C++
if (cur->left == NULL && cur->right == NULL) { // 遇到叶子节点 if (cur->left == NULL && cur->right == NULL) { // 遇到叶子节点
string sPath; string sPath;
for (int i = 0; i < path.size() - 1; i++) { // 将path里记录的路径转为string格式 for (int i = 0; i < path.size() - 1; i++) { // 将path里记录的路径转为string格式
@ -113,7 +113,7 @@ if (cur->right) {
那么回溯要怎么回溯呢，一些同学会这么写，如下： 那么回溯要怎么回溯呢，一些同学会这么写，如下：
``` ```C++
if (cur->left) { if (cur->left) {
traversal(cur->left, path, result); traversal(cur->left, path, result);
} }
@ -129,7 +129,7 @@ path.pop_back();
那么代码应该这么写： 那么代码应该这么写：
``` ```C++
if (cur->left) { if (cur->left) {
traversal(cur->left, path, result); traversal(cur->left, path, result);
path.pop_back(); // 回溯 path.pop_back(); // 回溯