Merge Two Binary Trees
来源:互联网 发布:getdata软件 编辑:程序博客网 时间:2024/05/22 04:51
原题链接
题目主要的意思如下:
- 如果两棵树内对应节点均有数据,则节点值相加;
- 如果没有,则将对应子树进行拼接。
思路:
分治法。因为对每个节点的操作都可以分割为独立的小问题。
class Solution { public TreeNode mergeTrees(TreeNode t1, TreeNode t2) { if (t1 == null && t2 == null) return null; int val = (t1 == null ? 0 : t1.val) + (t2 == null ? 0 : t2.val); TreeNode newNode = new TreeNode(val); newNode.left = mergeTrees(t1 == null ? null : t1.left, t2 == null ? null : t2.left); newNode.right = mergeTrees(t1 == null ? null : t1.right, t2 == null ? null : t2.right); return newNode; }}
阅读全文
0 0
- Merge Two Binary Trees
- Merge Two Binary Trees
- Merge Two Binary Trees
- Merge Two Binary Trees
- Merge Two Binary Trees
- Merge Two Binary Trees
- Merge Two Binary Trees
- Merge Two Binary Trees
- Merge Two Binary Trees
- 617. Merge Two Binary Trees
- Leetcode617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- leetcode617: Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 【leetcode】 Merge Two Binary Trees
- leetcode617. Merge Two Binary Trees
- JavaScript中prototype(原型)给字符串对象添加一个toCharArray的方法,reverse(翻转)的 方法
- 剑指_实现从后向前遍历的方法
- js基础之各种基本类型及引用类型的转换之开篇
- [leetcode] 718. Maximum Length of Repeated Subarray
- UE4移动组件详解(二)——移动同步机制
- Merge Two Binary Trees
- MAC 下个人常用命令备忘录
- 安卓setText(java.lang.CharSequence) on a null object reference解决办法
- 如何让eclipse进行智能提示
- 数据结构-用数组模拟栈
- not get much sleep that night after the
- TensorBoard-01-网络结构
- spring jar包详解
- 洛谷P3371 【模板】单源最短路径