From 34e1b0ab5ce4a839ac9bf40b9e7ceb582fd51119 Mon Sep 17 00:00:00 2001
From: ayao98 <91120769+ayao98@users.noreply.github.com>
Date: Mon, 3 Apr 2023 15:48:51 +0800
Subject: [PATCH] =?UTF-8?q?Update=200112.=E8=B7=AF=E5=BE=84=E6=80=BB?=
 =?UTF-8?q?=E5=92=8C.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0112.路径总和.md | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/problems/0112.路径总和.md b/problems/0112.路径总和.md
index 9b6027d1..5958de93 100644
--- a/problems/0112.路径总和.md
+++ b/problems/0112.路径总和.md
@@ -250,7 +250,7 @@ private:
     vector<vector<int>> result;
     vector<int> path;
     // 递归函数不需要返回值，因为我们要遍历整个树
-    void traversal(treenode* cur, int count) {
+    void traversal(TreeNode* cur, int count) {
         if (!cur->left && !cur->right && count == 0) { // 遇到了叶子节点且找到了和为sum的路径
             result.push_back(path);
             return;
@@ -276,10 +276,10 @@ private:
     }
 
 public:
-    vector<vector<int>> pathsum(treenode* root, int sum) {
+    vector<vector<int>> pathSum(TreeNode* root, int sum) {
         result.clear();
         path.clear();
-        if (root == null) return result;
+        if (root == NULL) return result;
         path.push_back(root->val); // 把根节点放进路径
         traversal(root, sum - root->val);
         return result;