Commit 259d197

committed

Merge branch 'master' of github.com:youngyangyang04/leetcode-master

2 parents 7ab1e2d + b69b852 commit 259d197Copy full SHA for 259d197

File tree

-4

lines changed

-4

lines changed

Lines changed: 4 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -40,15 +40,15 @@`
`40`	`40`
`41`	`41`	`要传入根节点,记录每一条路径的path,和存放结果集的result,这里递归不需要返回值,代码如下:`
`42`	`42`
`43`		-```
	`43`	+```CPP
`44`	`44`	`void traversal(TreeNode* cur, vector<int>& path, vector<string>& result)`
`45`	`45`	```
`46`	`46`
`47`	`47`	`2. 确定递归终止条件`
`48`	`48`
`49`	`49`	`在写递归的时候都习惯了这么写:`
`50`	`50`
`51`		-```
	`51`	+```CPP
`52`	`52`	`if (cur == NULL) {`
`53`	`53`	`终止处理逻辑`
`54`	`54`	`}`
`@@ -59,7 +59,7 @@ if (cur == NULL) {`
`59`	`59`	`那么什么时候算是找到了叶子节点? 是当 cur不为空,其左右孩子都为空的时候,就找到叶子节点。`
`60`	`60`
`61`	`61`	`所以本题的终止条件是:`
`62`		-```
	`62`	+```CPP
`63`	`63`	`if (cur->left == NULL && cur->right == NULL) {`
`64`	`64`	`终止处理逻辑`
`65`	`65`	`}`
`@@ -102,7 +102,7 @@ if (cur->left == NULL && cur->right == NULL) { // 遇到叶子节点`
`102`	`102`
`103`	`103`	`所以递归前要加上判断语句,下面要递归的节点是否为空,如下`
`104`	`104`
`105`		-```
	`105`	+```CPP
`106`	`106`	`if (cur->left) {`
`107`	`107`	`traversal(cur->left, path, result);`
`108`	`108`	`}`

Comments

(0)