Skip to content

[Tony] WEEK 12 Solutions #564

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 5 commits into from
Nov 3, 2024
Merged

[Tony] WEEK 12 Solutions #564

Changes from 1 commit
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
5f1ed68
Same Tree
TonyKim9401 Oct 28, 2024
612595a
Remove Nth Node From End Of List
TonyKim9401 Oct 29, 2024
79fbf03
Remove Nth Node From End Of List
TonyKim9401 Oct 29, 2024
a14bddf
Merge Intervals
TonyKim9401 Oct 30, 2024
eda7ce0
Number Of Connected Components In An Undirected Graph
TonyKim9401 Nov 1, 2024
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
17 changes: 17 additions & 0 deletions same-tree/TonyKim9401.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
// TC: O(n)
// retreive all given nodes
// SC: O(1)
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

dfs 스택을 사용하는 만큼 O(N) 이지 않을까요~?

// doesn't require additional space
class Solution {
public boolean isSameTree(TreeNode p, TreeNode q) {
if (p == null || q == null) {
if (p == null && q == null) return true;
return false;
Comment on lines +8 to +9
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

😉

Suggested change
if (p == null && q == null) return true;
return false;
return p == null && q == null;

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

헐

Copy link
Contributor

@bky373 bky373 Nov 3, 2024 •
edited
Loading

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

L7 ~ L10 을 조금 더 줄여서 아래처럼 가능할 것 같습니다!

if (p == null || q == null) {
    return p == q;
}

}

if (p.val != q.val) return false;

return isSameTree(p.left, q.left) &&
isSameTree(p.right, q.right);
}
}