-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path337.cpp
More file actions
42 lines (40 loc) · 1.2 KB
/
Copy path337.cpp
File metadata and controls
42 lines (40 loc) · 1.2 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
/*******************************************************************************
> File Name: 337.cpp
> Author: sillyplus
> Mail: oi_boy@sina.cn
> Created Time: Sat Mar 19 02:00:00 2016
*******************************************************************************/
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int rob(TreeNode* root) {
vector<int> ret = value(root);
return max(ret[0], ret[1]);
}
vector<int> value(TreeNode* root) {
vector<int> ret;
if (root == NULL) {
ret.push_back(0);
ret.push_back(0);
return ret;
}
if (root->left == NULL && root->right == NULL) {
ret.push_back(0);
ret.push_back(root->val);
return ret;
}
vector<int> leftRet = value(root->left);
vector<int> rightRet = value(root->right);
ret.push_back(max(leftRet[0], leftRet[1]) + max(rightRet[0], rightRet[1]));
ret.push_back(leftRet[0] + rightRet[0] + root->val);
return ret;
}
};