diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /other/max_product_split_bt.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/max_product_split_bt.cpp')
-rw-r--r-- | other/max_product_split_bt.cpp | 19 |
1 files changed, 19 insertions, 0 deletions
diff --git a/other/max_product_split_bt.cpp b/other/max_product_split_bt.cpp new file mode 100644 index 0000000..71fc9a4 --- /dev/null +++ b/other/max_product_split_bt.cpp @@ -0,0 +1,19 @@ +#include "leetcode.h" + +class Solution { +public: + int maxProduct(TreeNode *root) { + tot = solve(root), solve(root); + return ans % (1e9 + 7); + } + +private: + long ans = 0, tot = 0, sub; + int solve(TreeNode *root) { + if (!root) + return 0; + sub = root->val + solve(root->left) + solve(root->right); + ans = max(ans, sub * (tot - sub)); + return sub; + } +}; |