-
Notifications
You must be signed in to change notification settings - Fork 125
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
[Jeehay Park(박지혜)] Week 2 #724
Merged
Merged
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
TonyKim9401
reviewed
Dec 21, 2024
Comment on lines
+16
to
+37
var climbStairs = function (n) { | ||
let ways = 0; | ||
|
||
let maxStepTwo = Math.floor(n / 2); | ||
|
||
const factorial = (num) => { | ||
if (num === 0 || num === 1) { | ||
return 1; | ||
} | ||
|
||
for (let i = 2; i <= num; i++) { | ||
return num * factorial(num - 1); | ||
} | ||
}; | ||
|
||
for (let i = 0; i <= maxStepTwo; i++) { | ||
const stepTwo = i; | ||
const stepOne = n - 2 * i; | ||
const steps = stepTwo + stepOne; | ||
|
||
ways += factorial(steps) / (factorial(stepTwo) * factorial(stepOne)); | ||
} |
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를 사용하시면 시간 복잡도를 O(n) 으로 줄일 수 있을것 같아요 :)
TonyKim9401
approved these changes
Dec 21, 2024
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.
2주차 문제풀이 고생 많으셨습니다!
여러 풀이 과정을 도전하시면서 노력하신 흔적이 너무너무 보기 좋네요!
3주차도 파이팅입니다!
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
로 설정해주세요.