class Solution {
public:
TreeNode* mergeTrees(TreeNode* root1, TreeNode* root2) {
if(root1&&root2)
{
root1->val+=root2->val;
if(root1->left&&root2->left) mergeTrees(root1->left,root2->left);
if(root1->right&&root2->right)mergeTrees(root1->right,root2->right);
if(!root1->left&&root2->left)
root1->left=root2->left;
if(!root1->right&&root2->right)
root1->right=root2->right;
}
else if(!root1&&root2) root1=root2;
return root1;
}
};
简单题,但做了半个小时,太慢了。
昨天看EDG夺冠去了,落下好多题。
加油。
class Solution {
public:
TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
if (t1 == nullptr) {
return t2;
}
if (t2 == nullptr) {
return t1;
}
auto merged = new TreeNode(t1->val + t2->val);
merged->left = mergeTrees(t1->left, t2->left);
merged->right = mergeTrees(t1->right, t2->right);
return merged;
}
};
原来要new一棵新的出来吗
纳闷怎么广度优先的代码那么长。