-
Notifications
You must be signed in to change notification settings - Fork 126
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
[byteho0n] - Week 7 #934
[byteho0n] - Week 7 #934
Conversation
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.
안녕하세요 bytehoOn님, 이번 한 주도 수고하셨습니다 :)
상세한 설명 덕에 초스피드 리뷰가 가능했습니다.. 정말 감사합니다
코멘트를 좀 남겨놓았으니 병합 전에 확인 바랍니다
감사합니다
dp[i][j] = dp[i-1][j] + dp[i][j-1] | ||
|
||
tc : O(mn) | ||
sc : O(mn) |
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.
공간복잡도를 O(m)까지 낮춰볼 수 있을까요?
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.
1D 배열로 압축하면 될 것 같네요! 어차피 dp[i-1][j]는 1차원 배열에서 바뀌기 이전값을 의미하니 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
로 설정해주세요.