236. 二叉树的最近公共祖先

最新推荐文章于 2024-10-17 11:39:06 发布

baixiaofei567

最新推荐文章于 2024-10-17 11:39:06 发布

阅读量81

点赞数

分类专栏： leetcode # 树文章标签：二叉树算法 leetcode 数据结构

本文链接：https://blog.csdn.net/J_avaSmallWhite/article/details/112502990

版权

leetcode 同时被 2 个专栏收录

343 篇文章 0 订阅

订阅专栏

树

110 篇文章 0 订阅

订阅专栏

在这里插入图片描述

lca算法，递归查询即可，如果当前结点为p或者q就返回当前结点，left等于取当前结点左子树查找的结果，right等于取右子树查找的结果，如果都不为l和r均不为空就返回root，如果左为空，那么就在右子树，就返回在右子树的查询结果即可（right），反之返回left

/**
 * 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:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(root == NULL) return NULL;
        if(root == p || root == q) return root;

        TreeNode* left = lowestCommonAncestor(root->left,p,q);
        TreeNode* right = lowestCommonAncestor(root->right,p,q);
        if(left == NULL) return right;
        if(right == NULL) return left;
        return root;
    }
};

这道题翻车太多太多次了，如果左为空，直接返回right即可，不要再去右子树搜索了，已经搜索过了！就是right，如果右为空，直接返回left。如果均不为空，那么root就是结果

/**
 * 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:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(root == NULL || root == p || root == q) return root;
        TreeNode* left = lowestCommonAncestor(root->left,p,q);
        TreeNode* right = lowestCommonAncestor(root->right,p,q);
        if(left == NULL) return right;
        if(right == NULL) return left;
        return root;
    }
};

事不过三，轻松

/**
 * 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:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        //如果在当前结点的左右两边都找到了就返回当前结点，不然就返回找到的那一边
        if(root == NULL) return NULL;
        if(root == p || root == q) return root;
        TreeNode* l = lowestCommonAncestor(root->left,p,q);
        TreeNode* r = lowestCommonAncestor(root->right,p,q);
        if(l!=NULL && r!= NULL) return root;
        return l==NULL?r:l;
    }
};

四刷

class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        //如果为空或者等于p或者q任意一个就返回
        //如果都是，就递归搜索左边和右边，如果左右均不为空，直接返回root，否则返回非空的那个
        if(root == NULL || root == p || root == q) return root;
        TreeNode* l = lowestCommonAncestor(root->left,p,q);
        TreeNode* r = lowestCommonAncestor(root->right,p,q);
        if(l != NULL && r!= NULL) return root;
        return l == NULL?r:l;
    }
};