-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathmain.cxx
More file actions
73 lines (55 loc) · 1.27 KB
/
main.cxx
File metadata and controls
73 lines (55 loc) · 1.27 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include <bits/stdc++.h>
#include <gtest/gtest.h>
using namespace std;
/**
* Definition for a binary tree node.
*/
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode() : val(0), left(nullptr), right(nullptr) {}
TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};
class Solution {
public:
vector<double> averageOfLevels(TreeNode* root) {
vector<double> ret;
if (!root) return ret;
queue<TreeNode*> qq;
qq.push(root);
while(!qq.empty()){
int qlen = qq.size();
int n = qlen;
long sum = 0;
while(qlen > 0){
qlen--;
auto now = qq.front();
qq.pop();
sum += now->val;
if (now->left) qq.push(now->left);
if (now->right) qq.push(now->right);
}
ret.push_back(sum/double(n));
}
return ret;
}
};
struct T{
};
TEST(Solution,test){
T ts[] = {
{
},
{
},
};
for (T t : ts){
Solution solution;
}
}
int main() {
testing::InitGoogleTest();
return RUN_ALL_TESTS();
}