-
Notifications
You must be signed in to change notification settings - Fork 11
/
Day-094.cpp
30 lines (30 loc) · 900 Bytes
/
Day-094.cpp
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
/**
* 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 {
int intAns;
int dfs(TreeNode* root){
if(root == nullptr){
return 0;
}
int intLeftSum = dfs(root -> left);
int intRightSum = dfs(root -> right);
//cout << intLeftSum << " : " << intRightSum << '\n';
intAns = max(intAns , intRightSum + intLeftSum + root -> val);
return max(0, root->val + max(intLeftSum , intRightSum));
}
public:
int maxPathSum(TreeNode* root) {
intAns = INT_MIN;
dfs(root);
return intAns;
}
};