leetcode 617. 合并二叉树( java & python3 )

最新推荐文章于 2024-10-01 04:50:10 发布

姐姐的半熟芝士

最新推荐文章于 2024-10-01 04:50:10 发布

阅读量603

点赞数 1

分类专栏：学习做题leetcode 文章标签：算法深度优先 java python 二叉树

本文链接：https://blog.csdn.net/qq_45908682/article/details/122101861

版权

学习做题leetcode 专栏收录该内容

341 篇文章 1 订阅

订阅专栏

java:

没有感情的dfs 简单题还是友好

希望我早点学习bfs 呜呜呜

class Solution {
    public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
        if( root1 == null ){
            return root2;
        }
        if( root2 == null ){
            return root1;
        }
        TreeNode ans = new TreeNode( root1.val + root2.val );
        ans.left = mergeTrees(root1.left, root2.left);
        ans.right = mergeTrees(root1.right, root2.right);
        return ans;
    }
}

python3:

class Solution:
    def mergeTrees(self, root1: TreeNode, root2: TreeNode) -> TreeNode:
        if not root1:
            return root2
        if not root2:
            return root1
        ans = TreeNode(root1.val + root2.val)
        ans.left = self.mergeTrees(root1.left,root2.left)
        ans.right = self.mergeTrees(root1.right,root2.right)
        return ans