236. Lowest Common Ancestor of a Binary Tree
来源:互联网 发布:淘宝网短袖圆领男内衣 编辑:程序博客网 时间:2024/06/01 07:15
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes v and w as the lowest node in T that has both v and w as descendants (where we allow a node to be a descendant of itself).”
_______3______
/ \
___5__ ___1__
/ \ / \
6 _2 0 8
/ \
7 4
For example, the lowest common ancestor (LCA) of nodes 5 and 1 is 3. Another example is LCA of nodes 5 and 4 is 5, since a node can be a descendant of itself according to the LCA definition.
找两棵树的最低父节点
自己做出来了一个递归的解法 但是stackoverflow了 testcase的树深度特别大 下面的解法会占用大量内存 但是可以通过testcase
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) { Map<TreeNode, TreeNode> parent = new HashMap<>(); Deque<TreeNode> stack = new ArrayDeque<>(); parent.put(root, null); stack.push(root); while (!parent.containsKey(p) || !parent.containsKey(q)) { TreeNode node = stack.pop(); if (node.left != null) { parent.put(node.left, node); stack.push(node.left); } if (node.right != null) { parent.put(node.right, node); stack.push(node.right); } } Set<TreeNode> ancestors = new HashSet<>(); while (p != null) { ancestors.add(p); p = parent.get(p); } while (!ancestors.contains(q)) q = parent.get(q); return q;}
遍历整棵树把对应关系存入parent key是节点 value是父节点
然后获取p的所有父节点 对q 从下到上逐层获取父节点 找到第一个与p的公共父节点 也就是最低的公共父节点
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) { if(root == null || root == p || root == q) return root;//1. TreeNode left = lowestCommonAncestor(root.left, p, q); TreeNode right = lowestCommonAncestor(root.right, p, q); if(left != null && right != null) return root;//2. return left != null ? left : right;//3.}
效率比较高 但是之前觉得不是很好理解
四个月之后再看 感觉也不难理解
1.如果p是根节点 那么直接返回 因为q肯定是p的子节点
2.如果在当前节点下找到了p和q 那当前节点就是最低父节点 返回即可
3.如果在当前节点下 没找到q 那说明q是p的子节点 返回p即可
阅读全文
0 0
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree(***)
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Tree
- 递归方法
- ZOJ Problem Set
- Linux 文件编程
- qt qml和c++交互的一个简单例子
- CCNP
- 236. Lowest Common Ancestor of a Binary Tree
- Android 7.1 GUI系统-窗口管理WindowManagerService(一)
- CSAPP Note chap3
- mybatis gengerator
- laravel数据填充(seeder)及faker和tinker的使用
- 基于PCL的三维重建—贪婪投影三角化算法实践与参数设置
- matlab矩阵及其基本运算—特征值分解和奇异值分解
- C++ Primer Plus 编程练习 3.7.5
- 14 关于栈帧(修改)