示例 1:
示例 2:
class Solution {public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {if(root1 == null){return root2;}if(root2 == null){return root1;}root1.val = root1.val + root2.val;root1.left = mergeTrees(root1.left,root2.left);root1.right = mergeTrees(root1.right,root2.right);return root1; }
}
struct TreeNode* mergeTrees(struct TreeNode* root1, struct TreeNode* root2)
{if(root1 == NULL){return root2;}if(root2 == NULL){return root1;}root1->val = root1->val + root2->val;root1->left = mergeTrees(root1->left,root2->left);root1->right = mergeTrees(root1->right,root2->right);return root1;
}
class Solution:def mergeTrees(self, root1: Optional[TreeNode], root2: Optional[TreeNode]) -> Optional[TreeNode]:if root1 is None:return root2if root2 is None:return root1root1.val = root1.val + root2.valroot1.left = self.mergeTrees(root1.left,root2.left)root1.right = self.mergeTrees(root1.right,root2.right)return root1
class Solution {
public:TreeNode* mergeTrees(TreeNode* root1, TreeNode* root2) {if(root1 == nullptr){return root2;}if(root2 == nullptr){return root1;}root1->val = root1->val + root2->val;root1->left = mergeTrees(root1->left,root2->left);root1->right = mergeTrees(root1->right,root2->right);return root1;}
};
Java语言版
C语言版
Python语言版
C++语言版
上一篇:MySQL调优补充
下一篇:ROS项目的GDB调试