Open
Conversation
nodchip
reviewed
Oct 19, 2025
|
|
||
| ### step3 | ||
|
|
||
| * 簡単な問題なので省略。ただし LeetCode に色々別解はある。 |
There was a problem hiding this comment.
ぱっと思いつくのは、
- 深さ優先探索
- キャッシュ付き深さ優先探索
- 動的計画法
- 行列の n 乗
- フィボナッチ数列の一般項
あたりでした。自分が面接官なら、動的計画法までを期待値とすると思います。すらすら解けたら、行列の n 乗の方法を説明したうえで、 m * m 正方行列の乗算のコードを書けるかどうか試すと思います。
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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.
70. Climbing Stairs
https://leetcode.com/problems/climbing-stairs/