LeetCode
来源:互联网 发布:oracle和mysql哪个好 编辑:程序博客网 时间:2024/06/05 10:23
Q:
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.
A:
# Definition for a binary tree node.class TreeNode(object): def __init__(self, x): self.val = x self.left = None self.right = Noneclass Solution(object): def mergeTrees(self, t1, t2): """ :type t1: TreeNode :type t2: TreeNode :rtype: TreeNode """ if t1 == None: return t2 if t2 == None: return t1 t1.val += t2.val t1.left = self.mergeTrees(t1.left, t2.left) t1.right = self.mergeTrees(t1.right, t2.right) return t1
阅读全文
0 0
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode
- leetcode:
- leetcode:
- LeetCode
- leetcode
- LEETCODE
- leetcode
- leetCode
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode:
- leetcode
- 欢迎使用CSDN-markdown编辑器
- 数据结构--梳排序(CombSort)思想与实现
- Pytorch常用函数
- 安卓自定义View基础09--Path之基本操作
- 103. Binary Tree Zigzag Level Order Traversal
- LeetCode
- Kylin在CDH中的安装
- 编写一个程序计算后缀表达式的值
- 表情识别训练过程
- 最小生成树之prim算法概念与实现
- 整数划分 51Nod
- 堆和堆排序
- 内存对齐
- python单元测试框架