From dc1f0c4c0096013799416664894c5194dc7e1f52 Mon Sep 17 00:00:00 2001
From: Yuqian Yang <crupest@crupest.life>
Date: Fri, 28 Feb 2025 23:13:39 +0800
Subject: chore(store): move everything to store.

---
 .../leetcode/cpp/paths-with-sums-lcci.cpp          | 46 ++++++++++++++++++++++
 1 file changed, 46 insertions(+)
 create mode 100644 store/works/solutions/leetcode/cpp/paths-with-sums-lcci.cpp

(limited to 'store/works/solutions/leetcode/cpp/paths-with-sums-lcci.cpp')

diff --git a/store/works/solutions/leetcode/cpp/paths-with-sums-lcci.cpp b/store/works/solutions/leetcode/cpp/paths-with-sums-lcci.cpp
new file mode 100644
index 0000000..697182d
--- /dev/null
+++ b/store/works/solutions/leetcode/cpp/paths-with-sums-lcci.cpp
@@ -0,0 +1,46 @@
+#include <cstddef>
+
+struct TreeNode
+{
+    int val;
+    TreeNode *left;
+    TreeNode *right;
+    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+};
+
+#include <vector>
+
+class Solution
+{
+public:
+    std::vector<int> current;
+
+    int dfs(TreeNode *root, int sum)
+    {
+        if (root == nullptr)
+            return 0;
+
+        current.push_back(root->val);
+
+        int s = 0;
+        int count = 0;
+
+        for (auto iter = current.crbegin(); iter != current.crend(); ++iter)
+        {
+            s += *iter;
+            if (s == sum)
+                count++;
+        }
+
+        count += dfs(root->left, sum) + dfs(root->right, sum);
+
+        current.pop_back();
+
+        return count;
+    }
+
+    int pathSum(TreeNode *root, int sum)
+    {
+        return dfs(root, sum);
+    }
+};
-- 
cgit v1.2.3