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);