Skip to content

feat: update ts solution to lc problems: No.0617 #1441

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Aug 13, 2023
Merged

feat: update ts solution to lc problems: No.0617 #1441

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
10 changes: 5 additions & 5 deletions solution/0600-0699/0617.Merge Two Binary Trees/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -188,11 +188,11 @@ function mergeTrees(
root1: TreeNode | null,
root2: TreeNode | null,
): TreeNode | null {
if (root1 == null && root2 == null) return null;
if (root1 == null) return root2;
if (root2 == null) return root1;
let left = mergeTrees(root1.left, root2.left);
let right = mergeTrees(root1.right, root2.right);
if (root1 === null && root2 === null) return null;
if (root1 === null) return root2;
if (root2 === null) return root1;
const left = mergeTrees(root1.left, root2.left);
const right = mergeTrees(root1.right, root2.right);
return new TreeNode(root1.val + root2.val, left, right);
}
```
Expand Down
10 changes: 5 additions & 5 deletions solution/0600-0699/0617.Merge Two Binary Trees/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -169,11 +169,11 @@ function mergeTrees(
root1: TreeNode | null,
root2: TreeNode | null,
): TreeNode | null {
if (root1 == null && root2 == null) return null;
if (root1 == null) return root2;
if (root2 == null) return root1;
let left = mergeTrees(root1.left, root2.left);
let right = mergeTrees(root1.right, root2.right);
if (root1 === null && root2 === null) return null;
if (root1 === null) return root2;
if (root2 === null) return root1;
const left = mergeTrees(root1.left, root2.left);
const right = mergeTrees(root1.right, root2.right);
return new TreeNode(root1.val + root2.val, left, right);
}
```
Expand Down
10 changes: 5 additions & 5 deletions solution/0600-0699/0617.Merge Two Binary Trees/Solution.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -16,10 +16,10 @@ function mergeTrees(
root1: TreeNode | null,
root2: TreeNode | null,
): TreeNode | null {
if (root1 == null && root2 == null) return null;
if (root1 == null) return root2;
if (root2 == null) return root1;
let left = mergeTrees(root1.left, root2.left);
let right = mergeTrees(root1.right, root2.right);
if (root1 === null && root2 === null) return null;
if (root1 === null) return root2;
if (root2 === null) return root1;
const left = mergeTrees(root1.left, root2.left);
const right = mergeTrees(root1.right, root2.right);
return new TreeNode(root1.val + root2.val, left, right);
}