617. Merge Two Binary Trees(Java)
来源:互联网 发布:看杀卫玠知乎 编辑:程序博客网 时间:2024/06/05 08:15
Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.
You need to merge them into a new binary tree. The merge rule is that if two nodes overlap, then sum node values up as the new value of the merged node. Otherwise, the NOT null node will be used as the node of new tree.
Example 1:Input: Tree 1 Tree 2 1 2 / \ / \ 3 2 1 3 / \ \ 5 4 7 Output: Merged tree: 3 / \ 4 5 / \ \ 5 4 7
Note: The merging process must start from the root nodes of both trees.
/** * 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 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; }}
public class Solution { public TreeNode mergeTrees(TreeNode t1, TreeNode t2) { if (t1 == null && t2 == null) return null; else if (t1 == null) return t2; else if (t2 == null) return t1; TreeNode n= new TreeNode(t1.val + t2.val); n.left = mergeTrees(t1.left, t2.left); n.right = mergeTrees(t1.right, t2.right); return n; }}
阅读全文
0 0
- [LeetCode]617. Merge Two Binary Trees<Java>
- 617. Merge Two Binary Trees(Java)
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 617. Merge Two Binary Trees
- 进制转换(十进制转换N进制)的实现
- 超详细java中的ClassLoader详解
- Android内存进程管理机制
- 5.3二叉树的存储结构
- 风格迁移转换的两种实现
- 617. Merge Two Binary Trees(Java)
- revit二次开发之单位转换
- wsdl和wadl区别
- hdu6114.Chess(求组合数)
- Greenplum:ARNING: database "xxxx" must be vacuumed within xxxx transactions,HINT: To avoid a databas
- Android开发-工具类-Tools-获得本周周一到周日日期(可以跨年计算)-AndroidStudio
- 【软件工程】大道至简软件工程读书总结
- sqlldr从服务器上获取txt文件数据导入到数据库
- android 内存进程管理分析