[DoDo] Week 1 #655
Merged
[DoDo] Week 1 #655
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
obzva
reviewed
Dec 11, 2024
| // 1. 이전 집까지의 최대 금액 (현재 집 스킵) | ||
| // 2. 전전 집까지의 최대 금액 + 현재 집 금액 (현재 집 선택) | ||
| for (let i = 2; i < len; i++) { | ||
| dp[i] = Math.max(dp[i - 1], dp[i - 2] + nums[i]); |
There was a problem hiding this comment.
안녕하세요~ 😊
해당 점화식을 잘 살펴보면 dp의 i, i-1, i-2번 요소만 사용하고 있다는 걸 알 수 있습니다
아직 시간이 좀 남았으니 공간 복잡도 최적화에 도전해보시면 어떨까요?
SamTheKorean
approved these changes
Dec 15, 2024
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로 설정해주세요.