-
Notifications
You must be signed in to change notification settings - Fork 11
/
Day-580.cpp
38 lines (38 loc) · 1.06 KB
/
Day-580.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
31
32
33
34
35
36
37
38
/**
* 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 minSum;
void dfs(TreeNode* root , int currentSum) {
if (currentSum > minSum) {
return;
}
if (root == nullptr) {
minSum = min(minSum , currentSum) ;
return;
}
currentSum+=root->val;
if (root -> left == nullptr && root -> right == nullptr) {
minSum = min(minSum , currentSum) ;
return ;
}
if (root->left)
dfs(root -> left , currentSum);
if (root->right)
dfs(root -> right , currentSum);
}
public:
int minimumSum(TreeNode* root) {
minSum = numeric_limits<int>::max();
dfs(root , 0);
return minSum;
}
};