[uraflower] WEEK 03 solutions #1285
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
uraflower
commented
Apr 16, 2025
Comment on lines
+42
to
+44
| // t: target | ||
| // 시간복잡도: O(2^t) | ||
| // 공간복잡도: O(t) |
There was a problem hiding this comment.
복잡도 계산이 올바른지 잘 모르겠습니다..!
There was a problem hiding this comment.
제가 알고리즘 풀이가 처음이라 복잡도 계산을 잘 모릅니다... 같이 해드릴수가 없어서 죄송합니다ㅠㅠ
byol-han
approved these changes
Apr 16, 2025
number-of-1-bits/uraflower.js
Outdated
There was a problem hiding this comment.
문자열을 배열로 변환해서 filter하시는 아이디어가 참신해요!
uraflower님의 풀이 보고 저도 열심히 공부하고 있습니다.
3주차도 끝까지 화이팅입니다 :)
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
답안 제출 문제
작성자 체크 리스트
In Review로 설정해주세요.검토자 체크 리스트
Important
본인 답안 제출 뿐만 아니라 다른 분 PR 하나 이상을 반드시 검토를 해주셔야 합니다!