Merge pull request #10 from weijiew/patch-1

Update 0112.路径总和.md
2021-05-05 10:14:47 +08:00 · 2021-05-05 10:14:47 +08:00 · a3f3c07c7c
parent 218c58bd72 a75ff6a04f
commit a3f3c07c7c
1 changed files with 1 additions and 1 deletions
--- a/problems/0112.路径总和.md
+++ b/problems/0112.路径总和.md
@ -249,7 +249,7 @@ private:
    vector<int> path;
    // 递归函数不需要返回值，因为我们要遍历整个树
    void traversal(TreeNode* cur, int count) {
-        if (!cur->left && !cur->right && count == 0) { // 遇到了叶子节点切找到了和为sum的路径
+        if (!cur->left && !cur->right && count == 0) { // 遇到了叶子节点且找到了和为sum的路径
            result.push_back(path);
            return;
        }