题目描述
解题思路:先序遍历,遇到合题就返回节点,没遇到就继续向下找,判断返回的左右子树是否合题,如果合题则输出。
解题代码:
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 p int整型
* @param q int整型
* @return int整型
*/
public int lowestCommonAncestor (TreeNode root, int p, int q) {
// write code here
TreeNode node = dfs(root,p,q);
return node.val;
}
public TreeNode dfs(TreeNode root, int p, int q){
if(root == null){
return root;
}
if(root.val == p || root.val == q){
return root;
}
TreeNode left = dfs(root.left, p, q);
TreeNode right = dfs(root.right, p, q);
if(left != null && right != null){
return root;
}
if(left!= null){
return left;
}
if(right != null){
return right;
}
return null;
}
}