LeetCode-Lowest Common Ancestor of a Binary Search Tree
来源:互联网 发布:人工智能是怎么来的 编辑:程序博客网 时间:2024/05/19 17:08
这个题是BST 有数值关系所以简单
假如root是两个node其中之一 , 或者两个node分布在root两边, root就是lca
else root向下至应该去的一边
public class Solution { public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) { if ( root == null || p == null || q ==null ) return null; while ( root.val != p.val && root.val != q.val ){ if (( root.val < q.val && root.val > p.val) || ( root.val > q.val && root.val< p.val)) return root; else if ( root.val > p.val) root = root.left; else root = root.right; } return root; }}
判断root的值是否在两个值之间 有个简便写法 很好
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) { while ((root.val - p.val) * (root.val - q.val) > 0) !!!!! root = p.val < root.val ? root.left : root.right; return root;}
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) { return (root.val - p.val) * (root.val - q.val) < 1 ? root : lowestCommonAncestor(p.val < root.val ? root.left : root.right, p, q);}
0 0
- leetcode 235: Lowest Common Ancestor of a Binary Search Tree
- LeetCode 235. Lowest Common Ancestor of a Binary Search Tree
- leetcode: Lowest Common Ancestor of a Binary Search Tree
- [leetcode][dfs] Lowest Common Ancestor of a Binary Search Tree
- [leetcode] 235.Lowest Common Ancestor of a Binary Search Tree
- 【LeetCode】235 Lowest Common Ancestor of a Binary Search Tree
- [LeetCode]235.Lowest Common Ancestor of a Binary Search Tree
- leetcode 235 Lowest Common Ancestor of a Binary Search Tree
- [leetcode] Lowest Common Ancestor of a Binary Search Tree
- LeetCode Lowest Common Ancestor of a Binary Search Tree
- leetCode(38):Lowest Common Ancestor of a Binary Search Tree
- leetcode-235-Lowest Common Ancestor of a Binary Search Tree
- [LeetCode]Lowest Common Ancestor of a Binary Search Tree
- Leetcode: Lowest Common Ancestor of a Binary Search Tree
- leetcode[235]:Lowest Common Ancestor of a Binary Search Tree
- Lowest Common Ancestor of a Binary Search Tree-leetcode
- 【leetcode】Lowest Common Ancestor of a Binary Search Tree
- 【Leetcode】Lowest Common Ancestor of a Binary Search Tree
- c++11特性与cocos2d-x 3.0之std::bind与std::function
- RPM -U 升级机制探索
- 启动2015世界人工智能系统智商排名,检测人工智能是否超越人类
- jsdoc块和内联标签
- 不固定流量的最小费用流 生产销售规划 uva11613 - Acme Corporation
- LeetCode-Lowest Common Ancestor of a Binary Search Tree
- nyoj--32--组合数
- android开发的各种bug-1
- 某格仔铺软件注册码算法的分析
- 【Linux学习笔记】Day1:U盘安装Debian8
- 同时持有多单和空单
- http://blog.csdn.net/u011975949/article/details/46868373
- sessionId 失效 ,后台“品”字后台跳转
- 15_09_14 English 学习