/**
* 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 ans;
void dfs(TreeNode* now,vector<int>& path){
if(now->left != NULL){
path.push_back(now->val);
dfs(now->left,path);
path.pop_back();
}
if(now->right != NULL){
path.push_back(now->val);
dfs(now->right,path);
path.pop_back();
}
for(int i=0;i<path.size();i++) ans = max(ans,abs(now->val - path[i]));
}
int maxAncestorDiff(TreeNode* root) {
ans = 0;
vector<int> v;
dfs(root,v);
return ans;
}
};
No.167 - LeetCode1206
最新推荐文章于 2022-07-26 21:49:37 发布