From 36e22cc4f871e02dd774b7ad052d6ab3233fc27c Mon Sep 17 00:00:00 2001
From: CyC2018 <zhengyc101@163.com>
Date: Wed, 28 Oct 2026 13:45:05 +0800
Subject: [PATCH] =?UTF-8?q?Update=2034.=20=E4=BA=8C=E5=8F=89=E6=A0=91?=
 =?UTF-8?q?=E4=B8=AD=E5=92=8C=E4=B8=BA=E6=9F=90=E4=B8=80=E5=80=BC=E7=9A=84?=
 =?UTF-8?q?=E8=B7=AF=E5=BE=84.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

题目链接改为力扣中的对应题目，题目描述和代码按该题的接口调整。
---
 notes/34. 二叉树中和为某一值的路径.md | 9 +++++----
 1 file changed, 5 insertions(+), 4 deletions(-)

diff --git a/notes/34. 二叉树中和为某一值的路径.md b/notes/34. 二叉树中和为某一值的路径.md
index 57f57b26..4280e610 100644
--- a/notes/34. 二叉树中和为某一值的路径.md	
+++ b/notes/34. 二叉树中和为某一值的路径.md	
@@ -1,6 +1,6 @@
 # 34. 二叉树中和为某一值的路径
 
-[NowCoder](https://www.nowcoder.com/practice/b736e784e3e34731af99065031301bca?tpId=13&tqId=11177&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
+[Leetcode](https://leetcode.cn/problems/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof/)
 
 ## 题目描述
 
@@ -13,14 +13,15 @@
 ## 解题思路
 
 ```java
-private ArrayList<ArrayList<Integer>> ret = new ArrayList<>();
+private List<List<Integer>> ret = new ArrayList<>();
 
-public ArrayList<ArrayList<Integer>> FindPath(TreeNode root, int target) {
+public List<List<Integer>> pathTarget(TreeNode root, int target) {
+    ret = new ArrayList<>();
     backtracking(root, target, new ArrayList<>());
     return ret;
 }
 
-private void backtracking(TreeNode node, int target, ArrayList<Integer> path) {
+private void backtracking(TreeNode node, int target, List<Integer> path) {
     if (node == null)
         return;
     path.add(node.val);