// 解法一:递归
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if(root==nullptr)
return nullptr;
if(root==p || root==q)
return root;
TreeNode* left=lowestCommonAncestor(root->left,p,q);
TreeNode* right=lowestCommonAncestor(root->right,p,q);
if(left!=nullptr && right!=nullptr)
return root;
else if(left==nullptr)
return right;
else if(right==nullptr)
return left;
return nullptr; // p,q存在的话不可能执行到这里
}
};
//解法二:存储父子关系
class Solution {
public:
unordered_map<int,TreeNode*> fa;
unordered_map<int,bool> vis;
void dfs(TreeNode* root){
if(root==nullptr) return;
if(root->left){
fa[root->left->val]=root;
dfs(root->left);
}
if(root->right){
fa[root->right->val]=root;
dfs(root->right);
}
}
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
fa[root->val]=nullptr;
dfs(root);
while(p!=nullptr){
vis[p->val]=true;
p=fa[p->val];
}
while(q!=nullptr){
if(vis[q->val]) return q;
q=fa[q->val];
}
return nullptr;
}
};