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

Abner_iii

已于 2022-10-24 10:01:06 修改

阅读量160

点赞数

分类专栏： LeetCode 文章标签： leetcode java 算法 1024程序员节

于 2022-08-25 10:08:44 首次发布

本文链接：https://blog.csdn.net/weixin_45703743/article/details/126518782

版权

LeetCode 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

算法

 /**
     *
     * ----------------2022.8.25------HouAlgo---------------------实现了，通过了。但是好像有待优化执行用时：7 ms, 在所有 Java 提交中击败了32.33%的用户内存消耗：43 MB, 在所有 Java 提交中击败了30.06%的用户
     * TreeNode result=null;
     * NearestAncestorOfBT(){
     *     traverseIfHasTarget(root,false);
     *     return result
     * }
     * traverseIfHasTarget(TreeNode root,boolean found)
     *   leftHasTarget=traverseIfHasTarget(root.left,found)
     *   rightHasTarget=traverseIfHasTarget(root.right,found)
     *   if((root==p&&leftHasTarget)||(root==p&&rightHasTarget)||(root==q&&leftHasTarget)||(root==q&&rightHasTarget)||(左子树含有目标节点&&右子树含有目标节点)||)
     *     if(!found){
     *        result=root;
     *        found=true;
     *    }
     *       return true;
     *    if(rightNow==p||rightNow==q||leftHasTarget||rightHasTarget)
     *       return true;
     *    else
     *       return false;
     *----------------2022.8.25------HouAlgo---------------------
     *
     */

代码

注：若复制粘贴，请修改类名和去除static。

public class NearestAncestorOfBT {
    static class Solution {
        static TreeNode result=null;
        static TreeNode pNode=null;
        static TreeNode qNode=null;
        public static TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
            pNode=p;
            qNode=q;
            traverseIfHasTarget(root,false);
            return result;
        }
        public static boolean traverseIfHasTarget(TreeNode root,boolean found){
            if(root==null) return false;
            boolean leftHasTarget=traverseIfHasTarget(root.left,found);
            boolean rightHasTarget=traverseIfHasTarget(root.right,found);
            if((root==pNode&&leftHasTarget)||(root==qNode&&rightHasTarget)||(leftHasTarget&&rightHasTarget)||(root==qNode&&leftHasTarget)||(root==pNode&&rightHasTarget)){
                if(!found){
                    result=root;
                    found=true;
                }
                return true;
            }
            if(root==pNode||root==qNode||leftHasTarget==true||rightHasTarget==true){
                return true;
            }
            else return false;

        }
    }








}