-
Notifications
You must be signed in to change notification settings - Fork 126
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.
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
[Tony] WEEK 14 Solutions #592
Conversation
@@ -0,0 +1,14 @@ | |||
public class Solution { | |||
public int reverseBits(int n) { | |||
// time complexity O(1) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
엇 time complexity가 O(N) 아닌가요?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
for문의 반복 횟수가 Integer.SIZE = 32
로 고정되니 O(1) 이라고 생각했는데 아닐까요!?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
오 맞네요 제가 생각이 짧았습니다 ㅎㅎㅎ
class Solution { | ||
private List<List<Integer>> output = new ArrayList<>(); | ||
public List<List<Integer>> levelOrder(TreeNode root) { | ||
dsf(0, root); |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
(완전완전 사소한 typo) dsf
-> dfs
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
이런... 수정해두겠습니다 ㅠ 오타가 제일 무서워요
return output; | ||
} | ||
|
||
private void dsf(int level, TreeNode node) { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
문제를 보고 저는 자연스레 BFS가 떠올라서 BFS로 풀이했는데, 이렇게 DFS로 풀이할 수도 있군요 ㅎㅎ
잘 봤습니다 👍👍
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
앗 저는 DFS밖에 생각이 안나서 ㅋㅋㅋ
Flynn님 풀이 보고 BFS 공부하겠습니다!
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
토니님 한 주 수고하셨습니다 :)
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.