[mike2ox] Week1 #653
Merged
[mike2ox] Week1 #653
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
|
안녕하세요 @mike2ox 님! 번거롭게 해서 정말 죄송해요! |
|
@HC-kang 넵! 문제풀고 제출하면서 확인해보겠습니다 :) 감사합니다! |
obzva
reviewed
Dec 10, 2024
house-robber/mike2ox.ts
Outdated
|
|
||
| // 남은 집을 순회하면서 최대값을 구함 | ||
| for (let i = 2; i < nums.length; i++) | ||
| dp[i] = Math.max(dp[i - 1], dp[i - 2] + nums[i]); |
There was a problem hiding this comment.
안녕하세요~ 점화식을 잘 보면 반복문 내에서 dp[i], dp[i - 1], dp[i - 2] 이렇게 세 요소만 사용하고 있다는 것을 알 수 있는데요
아직 제출까지 시간이 좀 남았으니 공간복잡도 최적화를 도전해보시면 어떨까요? :)
obzva
approved these changes
Dec 12, 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로 설정해주세요.