-
-
Notifications
You must be signed in to change notification settings - Fork 245
[mkwkw] WEEK 02 Solutions #1733
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
} | ||
|
||
//2. different map -> false | ||
map<char, int> sMap, tMap; |
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.
배열이나 unordered_map
을 사용할 수도 있겠군요.
dp[2] = 2; | ||
|
||
for(int i=3; i<=n; i++) |
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[2]
를 초기화하지 않고 i=2
부터 시작해도 되겠군요.
@@ -0,0 +1,81 @@ | |||
//Optimize complexity |
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.
아래 Division 풀이의 시간 복잡도와 공간 복잡도에 비해 더 최적화된 점이 없지 않나요?
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.
@SamTheKorean 이 파일처럼 비었지만 Merge 된 경우가 더 있네요: #1756 (comment)
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.
@SamTheKorean 이 파일처럼 비었지만 Merge 된 경우가 더 있네요: #1756 (comment)
답안 제출 문제
작성자 체크 리스트
In Review
로 설정해주세요.검토자 체크 리스트
Important
본인 답안 제출 뿐만 아니라 다른 분 PR 하나 이상을 반드시 검토를 해주셔야 합니다!