【剑指offer】在二叉树中找到两个节点的最近公共祖先

勿问东西

已于 2024-10-04 11:44:14 修改

阅读量45

点赞数

分类专栏：算法与数据结构文章标签：深度优先算法

于 2024-10-04 11:39:34 首次发布

本文链接：https://blog.csdn.net/weixin_43902408/article/details/142701441

版权

算法与数据结构专栏收录该内容

15 篇文章 0 订阅

订阅专栏

在这里插入图片描述

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
方法一：
class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if (root == null || root.val == p.val || root.val == q.val){
            return root;
        }
        TreeNode left = lowestCommonAncestor(root.left, p, q);
        TreeNode right = lowestCommonAncestor(root.right, p, q);        

        if (left != null && right != null){
            return root;
        } else if (left == null && right != null){
            return right;
        } else if (left != null && right == null){
            return left;
        } else {
            return null;  
        }
    }
}

方法二：dfs（推荐）
public class Solution {
    public boolean flag = false;
    public void dfs(TreeNode root, ArrayList<Integer> path, int o){
        if(flag || root == null)
            return;
        path.add(root.val);
        if(root.val == o){
            flag = true;
            return;
        }
        //dfs遍历查找
        dfs(root.left, path, o);
        dfs(root.right, path, o);
        if(flag)
            return;
        path.remove(path.size() - 1);
    }
    public int lowestCommonAncestor (TreeNode root, int o1, int o2) {
        ArrayList<Integer> path1 = new ArrayList<Integer>();
        ArrayList<Integer> path2 = new ArrayList<Integer>();
        dfs(root, path1, o1);
        flag = false;
        dfs(root, path2, o2);
        int res = 0;
        for(int i = 0; i < path1.size() && i < path2.size(); i++){
            int x = path1.get(i);
            int y = path2.get(i);
            if(x == y)
                res = x;
            else
                break;
        }
        return res;
    }
}