mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-11 04:54:51 +08:00
Update 0257.二叉树的所有路径.md
This commit is contained in:
@ -470,7 +470,7 @@ class Solution {
|
||||
## Python:
|
||||
|
||||
|
||||
递归法+回溯(版本一)
|
||||
递归法+回溯
|
||||
```Python
|
||||
# Definition for a binary tree node.
|
||||
class Solution:
|
||||
@ -561,16 +561,11 @@ class Solution:
|
||||
迭代法:
|
||||
|
||||
```Python
|
||||
from collections import deque
|
||||
|
||||
|
||||
class Solution:
|
||||
"""二叉树的所有路径 迭代法"""
|
||||
|
||||
def binaryTreePaths(self, root: TreeNode) -> List[str]:
|
||||
# 题目中节点数至少为1
|
||||
stack, path_st, result = deque([root]), deque(), []
|
||||
path_st.append(str(root.val))
|
||||
stack, path_st, result = [root], [str(root.val)], []
|
||||
|
||||
while stack:
|
||||
cur = stack.pop()
|
||||
|
Reference in New Issue
Block a user