题解 | #在二叉树中找到两个节点的最近公共祖先#

import java.util.*;

/*
 * public class TreeNode {
 *   int val = 0;
 *   TreeNode left = null;
 *   TreeNode right = null;
 *   public TreeNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param root TreeNode类 
     * @param o1 int整型 
     * @param o2 int整型 
     * @return int整型
     */
    public int lowestCommonAncestor (TreeNode root, int o1, int o2) {
        // write code here
        boolean[] b = new boolean[1];
        return find(root, o1, o2, b);
    }
    // {5,14,1,3,#,#,#,12,#,4,13,0,6,#,#,15,#,#,#,9,7,#,2,#,#,8,11,10},9,7
    public int find(TreeNode root ,int o1, int o2, boolean[] b){
        if(root == null){
            return Integer.MIN_VALUE;
        }
        int i1 = Integer.MIN_VALUE; 
        int i2 = Integer.MIN_VALUE;
        int temp = Integer.MIN_VALUE;
        if(root.val == o1 || root.val == o2){
            return root.val;
        }else {
            i1 = find(root.left, o1, o2, b);
            i2 = find(root.right, o1, o2, b);
            if(i1 != Integer.MIN_VALUE && i2 != Integer.MIN_VALUE)
            {
                return root.val;
            }else if(i2 != Integer.MIN_VALUE ){
                return i2;
            }else if(i1 != Integer.MIN_VALUE){
                return i1;
            }
            return Integer.MIN_VALUE;
        }

    }
    
}