-
-
Notifications
You must be signed in to change notification settings - Fork 195
[choidabom] WEEK 03 solutions #1311
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
Conversation
@@ -0,0 +1,33 @@ | |||
// https://leetcode.com/problems/valid-anagram/submissions/1603502655/ | |||
|
|||
// TC: O(NlogN) |
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.
이런 식으로 시간 복잡도 적으면 서 하는 것 좋네요! 참고하겠습니다.
const stairs = [1, 2]; | ||
|
||
for (let i = 2; i < n; i++) { | ||
stairs[i] = stairs[i - 1] + stairs[i - 2]; |
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.
dp로 푸니 코드가 좀 더 깔끔하네요! 참고하겠습니다.
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
로 설정해주세요.검토자 체크 리스트
Important
본인 답안 제출 뿐만 아니라 다른 분 PR 하나 이상을 반드시 검토를 해주셔야 합니다!