[gomgom22] Week 2 #759
Merged
[gomgom22] Week 2 #759
Conversation
This file contains 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
|
고생 많으셨습니다! 잘 작성하셨네요. |
HC-kang
approved these changes
Dec 22, 2024
| /** | ||
| * @description | ||
| * 동적 프로그래밍(Dynamic Programming, DP)을 사용하여 계단을 오르는 방법 수를 계산합니다. | ||
| * - 점화식: dp[i] = dp[i-1] + dp[i-2] |
| * 두 문자열을 비교해서 Anagram 여부 확인 | ||
| * - 시간 복잡도: O(n) | ||
| * - 문자열 순회와 비교 과정을 포함하여 n은 문자열의 길이 | ||
| * - 공간 복잡도: 0(1) |
There was a problem hiding this comment.
오탈자가 하나 있네요 ㅎㅎ 0(1) -> O(1)
지금 풀이도 충분히 좋고 깔끔하게 잘 풀어주셨는데, 하나의 Object로 좀 더 빨리 리턴 할 수 있지 않을까요!
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로 설정해주세요.