2021-01-31

Day 1.31

二叉树的最近公共祖先

题目

思路（1）

class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        while(right(root,p)&&right(root,q))root=root.right;
        while(left(root,p)&&left(root,q))root=root.left;
        //这里写的不对，判断的不完整，但如果用下面的完整判断会超出时间限制
        /*while((left(root,p)&&left(root,q))||(right(root,p)&&right(root,q))){
            if(left(root,p)&&left(root,q))root=root.left;
            if(right(root,p)&&right(root,q))root=root.right;
        }*/
        return root;
    }
    //left方法判断t是否在root左边
    public boolean left(TreeNode root,TreeNode t){
        if(root.left==null)return false;
        if((root.left==t)||(left(root.left,t)||right(root.left,t))){
            return true;
        }
        return false;
    }
    //right方法判断t是否在root右边
    public boolean right(TreeNode root,TreeNode t){
        if(root.right==null)return false;
        if((root.right==t)||(left(root.right,t)||right(root.right,t))){
            return true;
        }
        return false;
    }
}

思路（2）（答案）

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);
        //如果left为空，说明这两个节点在root结点的右子树上，返回右子树查找的结果
        if (left == null)return right;
        //如果right为空，说明这两个节点在root结点的左子树上，返回左子树查找的结果
        if (right == null)return left;
        //如果left和right都不为空，说明这两个节点一个在root的左子树上一个在root的右子树上，返回root
        return root;
    }
}