算法
/**
*
* ----------------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;
}
}
}