May 27, 2023 · Dec 7, 2022 · Dec 9, 2022 · Mar 19, 2023 · Mar 20, 2023 · Mar 20, 2023
diff --git a/problems/0257.二叉树的所有路径.md b/problems/0257.二叉树的所有路径.md
Original file line number	Diff line number	Diff line change
Expand Up		@@ -497,15 +497,14 @@ class Solution:


		```
	递归法+回溯(版本二)
	递归法+隐形回溯(版本一)
		```Python
		# Definition for a binary tree node.
		# class TreeNode:
		# def __init__(self, val=0, left=None, right=None):
		# self.val = val
		# self.left = left
		# self.right = right
	import copy
		from typing import List, Optional

		class Solution:
Expand All		@@ -523,13 +522,13 @@ class Solution:
		if not node.left and not node.right:
		result.append('->'.join(map(str, path)))
		else:
	self.generate_paths(node.left, copy.copy(path), result)
	self.generate_paths(node.right, copy.copy(path), result)
	path.pop()
	# path[:] 是隐藏回溯
	self.generate_paths(node.left, path[:], result)
	self.generate_paths(node.right, path[:], result)

		```

	递归法+隐形回溯
	递归法+隐形回溯(版本二)
		```Python
		# Definition for a binary tree node.
		# class TreeNode:
Expand Down