/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
while ((root.val - p.val) * (root.val - q.val) > 0)
root = q.val < root.val ? root.left : root.right;
return root;
}
}
LeetCode 235. Lowest Common Ancestor of a Binary Search T...
235. Lowest Common Ancestor of a Binary Search Tree 题目：ht...
235. Lowest Common Ancestor of a Binary Search Tree 如果大于最...
235. Lowest Common Ancestor of a Binary Search Tree上一题：找最...
1143 Lowest Common Ancestor（30 分）The lowest common ancest...
Problem Given a binary search tree (BST), find the lowest...
https://leetcode.com/problems/lowest-common-ancestor-of-a...
如果树是查找树，可以优化
1.描述 Given a binary search tree (BST), find the lowest co...
Java，答案的想法很好，利用了二分树的特性
本文标题：235. Lowest Common Ancestor of a
本文链接：https://www.haomeiwen.com/subject/wkudmttx.html
网友评论