Commit d0f6653

committed

Update 0112.路径总和.md

it's important to avoid using reserved keywords as variable names. so i suggest changing "sum" to "targetSum" In order to maintain consistency with the original LeetCode problem, the term "TreeNode" can be replaced with "Optional[TreeNode]".

1 parent 4c37ced commit d0f6653Copy full SHA for d0f6653

File tree

1 file changed

+10

-10

lines changed

problems
- 0112.路径总和.md

1 file changed

+10

-10

lines changed

`‎problems/0112.路径总和.md‎`

Lines changed: 10 additions & 10 deletions

Original file line number	Diff line number	Diff line change
`@@ -564,10 +564,10 @@ class Solution:`
`564`	`564`
`565`	`565`	`return False`
`566`	`566`
`567`		`- def hasPathSum(self, root: TreeNode, sum: int) -> bool:`
	`567`	`+ def hasPathSum(self, root: Optional[TreeNode], targetSum: int) -> bool:`
`568`	`568`	`if root is None:`
`569`	`569`	`return False`
`570`		`- return self.traversal(root, sum - root.val)`
	`570`	`+ return self.traversal(root, targetSum - root.val)`
`571`	`571`	```
`572`	`572`
`573`	`573`	`(版本二) 递归 + 精简`
`@@ -579,12 +579,12 @@ class Solution:`
`579`	`579`	`# self.left = left`
`580`	`580`	`# self.right = right`
`581`	`581`	`class Solution:`
`582`		`- def hasPathSum(self, root: TreeNode, sum: int) -> bool:`
	`582`	`+ def hasPathSum(self, root: Optional[TreeNode], targetSum: int) -> bool:`
`583`	`583`	`if not root:`
`584`	`584`	`return False`
`585`		`- if not root.left and not root.right and sum == root.val:`
	`585`	`+ if not root.left and not root.right and targetSum == root.val:`
`586`	`586`	`return True`
`587`		`- return self.hasPathSum(root.left, sum - root.val) or self.hasPathSum(root.right, sum - root.val)`
	`587`	`+ return self.hasPathSum(root.left, targetSum - root.val) or self.hasPathSum(root.right, targetSum - root.val)`
`588`	`588`
`589`	`589`	```
`590`	`590`	`(版本三) 迭代`
`@@ -596,7 +596,7 @@ class Solution:`
`596`	`596`	`# self.left = left`
`597`	`597`	`# self.right = right`
`598`	`598`	`class Solution:`
`599`		`- def hasPathSum(self, root: TreeNode, sum: int) -> bool:`
	`599`	`+ def hasPathSum(self, root: Optional[TreeNode], targetSum: int) -> bool:`
`600`	`600`	`if not root:`
`601`	`601`	`return False`
`602`	`602`	`# 此时栈里要放的是pair<节点指针,路径数值>`
`@@ -659,13 +659,13 @@ class Solution:`
`659`	`659`
`660`	`660`	`return`
`661`	`661`
`662`		`- def pathSum(self, root: TreeNode, sum: int) -> List[List[int]]:`
	`662`	`+ def pathSum(self, root: Optional[TreeNode], targetSum: int) -> List[List[int]]:`
`663`	`663`	`self.result.clear()`
`664`	`664`	`self.path.clear()`
`665`	`665`	`if not root:`
`666`	`666`	`return self.result`
`667`	`667`	`self.path.append(root.val) # 把根节点放进路径`
`668`		`- self.traversal(root, sum - root.val)`
	`668`	`+ self.traversal(root, targetSum - root.val)`
`669`	`669`	`return self.result`
`670`	`670`	```
`671`	`671`
`@@ -678,7 +678,7 @@ class Solution:`
`678`	`678`	`# self.left = left`
`679`	`679`	`# self.right = right`
`680`	`680`	`class Solution:`
`681`		`- def pathSum(self, root: TreeNode, targetSum: int) -> List[List[int]]:`
	`681`	`+ def pathSum(self, root: Optional[TreeNode], targetSum: int) -> List[List[int]]:`
`682`	`682`
`683`	`683`	`result = []`
`684`	`684`	`self.traversal(root, targetSum, [], result)`
`@@ -703,7 +703,7 @@ class Solution:`
`703`	`703`	`# self.left = left`
`704`	`704`	`# self.right = right`
`705`	`705`	`class Solution:`
`706`		`- def pathSum(self, root: TreeNode, targetSum: int) -> List[List[int]]:`
	`706`	`+ def pathSum(self, root: Optional[TreeNode], targetSum: int) -> List[List[int]]:`
`707`	`707`	`if not root:`
`708`	`708`	`return []`
`709`	`709`	`stack = [(root, [root.val])]`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit d0f6653

File tree

1 file changed

1 file changed

`‎problems/0112.路径总和.md‎`

0 commit comments