[mandel-17] WEEK 02 solutions #2039
There are no files selected for viewing
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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,14 @@ | ||
| import collections | ||
|
|
||
| class Solution: | ||
| num_dict = collections.defaultdict(int) | ||
|
|
||
| def climbStairs(self, n: int) -> int: | ||
| if n <= 2: | ||
| return n | ||
|
|
||
| if self.num_dict[n]: | ||
| return self.num_dict[n] | ||
|
|
||
| self.num_dict[n] = self.climbStairs(n-1) + self.climbStairs(n-2) | ||
| return self.num_dict[n] |
|
Contributor
There was a problem hiding this comment. 간단하게 Counter를 활용하면 더 간결하게 구현할 수 있을 것 같습니다 |
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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,14 @@ | ||
| import collections | ||
|
|
||
| class Solution: | ||
| num_dict = collections.defaultdict(int) | ||
|
|
||
| def climbStairs(self, n: int) -> int: | ||
| if n <= 2: | ||
| return n | ||
|
|
||
| if self.num_dict[n]: | ||
| return self.num_dict[n] | ||
|
|
||
| self.num_dict[n] = self.climbStairs(n-1) + self.climbStairs(n-2) | ||
| return self.num_dict[n] |
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.
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칸 아래의 계단에 도달할 수 있는 방법의 수(2칸을 한 번에 오르면 현재 칸)+1칸 아래의 계단에 도달할 수 있는 방법의 수(1칸을 오르면 현재 칸)으로 DP식을 세우면 좀 더 효율적으로 문제를 해결할 수 있을 것 같습니다.