|
| 1 | +#include <bits/stdc++.h> |
| 2 | +#include <gtest/gtest.h> |
| 3 | +using namespace std; |
| 4 | + |
| 5 | + |
| 6 | +//// START |
| 7 | +/* |
| 8 | +## Maximum Average Subtree |
| 9 | + |
| 10 | +*/ |
| 11 | + |
| 12 | + |
| 13 | +/** |
| 14 | +* Definition for a binary tree node. |
| 15 | +*/ |
| 16 | + |
| 17 | +struct TreeNode { |
| 18 | + int val; |
| 19 | + TreeNode *left; |
| 20 | + TreeNode *right; |
| 21 | + TreeNode() : val(0), left(nullptr), right(nullptr) {} |
| 22 | + TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} |
| 23 | + TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} |
| 24 | +}; |
| 25 | + |
| 26 | +class Solution { |
| 27 | + public: |
| 28 | + double maximumAverageSubtree(TreeNode* root) { |
| 29 | + double sum =0;int count=0; |
| 30 | + run(root,sum,count); |
| 31 | + return maxAve; |
| 32 | + } |
| 33 | + void run(TreeNode* root, double &sum, int &count){ |
| 34 | + if (!root) return ; |
| 35 | + double leftsum = 0; |
| 36 | + double rightsum = 0; |
| 37 | + int leftcount = 0; |
| 38 | + int rightcount = 0; |
| 39 | + run(root->left, leftsum,leftcount); |
| 40 | + run(root->right,rightsum,rightcount); |
| 41 | + sum = leftsum+ rightsum + root->val; |
| 42 | + count = 1 + leftcount + rightcount; |
| 43 | + maxAve = max(maxAve, sum/ count); |
| 44 | + } |
| 45 | + private: |
| 46 | + double maxAve = 0; |
| 47 | + unordered_map<TreeNode*,double> msum; |
| 48 | + unordered_map<TreeNode*,int> mcount; |
| 49 | +}; |
| 50 | + |
| 51 | +//// END |
| 52 | +struct T{ |
| 53 | + |
| 54 | +}; |
| 55 | + |
| 56 | +TEST(Solution,test){ |
| 57 | + T ts[] = { |
| 58 | + { |
| 59 | + |
| 60 | + }, |
| 61 | + { |
| 62 | + |
| 63 | + }, |
| 64 | + |
| 65 | + }; |
| 66 | + |
| 67 | + |
| 68 | + for (T t : ts){ |
| 69 | + Solution solution; |
| 70 | + |
| 71 | + } |
| 72 | +} |
| 73 | + |
| 74 | +int main() { |
| 75 | + testing::InitGoogleTest(); |
| 76 | + |
| 77 | + return RUN_ALL_TESTS(); |
| 78 | +} |
| 79 | + |
| 80 | + |
0 commit comments