-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
236.java
48 lines (47 loc) · 1.59 KB
/
236.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
__________________________________________________________________________________________________
sample 5 ms submission
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if(root==null){return null;}
if(root==p||root==q){return root;}
TreeNode left=lowestCommonAncestor(root.left,p,q);
TreeNode right=lowestCommonAncestor(root.right,p,q);
if(left!=null&&right!=null){return root;};
if(left==null&&right==null){return null;};
return left!=null?left:right;
}
}
__________________________________________________________________________________________________
sample 32084 kb submission
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if (root==null) return null;
if(root==p || root == q) return root;
TreeNode leftLCA = lowestCommonAncestor(root.left,p,q);
TreeNode rightLCA = lowestCommonAncestor(root.right,p,q);
if (leftLCA!=null && rightLCA != null)
return root;
if (leftLCA == null)
return rightLCA;
return leftLCA;
}
}
__________________________________________________________________________________________________