diff options
| author | crupest <crupest@outlook.com> | 2020-10-02 22:23:55 +0800 |
|---|---|---|
| committer | crupest <crupest@outlook.com> | 2020-10-02 22:23:55 +0800 |
| commit | 22eb686d254334cd4136f52345941effc860c4fb (patch) | |
| tree | a0a935a949832cff1b357b1ce455d966c7de2168 | |
| parent | 6aab6d21db8de55ee30de15d54d4b739a179be46 (diff) | |
| download | solutions-22eb686d254334cd4136f52345941effc860c4fb.tar.gz solutions-22eb686d254334cd4136f52345941effc860c4fb.tar.bz2 solutions-22eb686d254334cd4136f52345941effc860c4fb.zip | |
Add problem paths-with-sums-lcci.
| -rw-r--r-- | cpp/paths-with-sums-lcci.cpp | 46 |
1 files changed, 46 insertions, 0 deletions
diff --git a/cpp/paths-with-sums-lcci.cpp b/cpp/paths-with-sums-lcci.cpp new file mode 100644 index 0000000..697182d --- /dev/null +++ b/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);
+ }
+};
|