70. Climbing Stairs(E, 跳臺階)
class Solution {
public int climbStairs(int n) {
int[] dp = new int[n];
dp[0] = 1;
if(n > 1) dp[1] = 2;
for (int i = 2; i<n; i++){
dp[i] = dp[i-1]+dp[i-
相關文章
- 1. leetcode【70】Climbing Stairs
- 2. LeetCode 70. Climbing Stairs
- 3. 【LeetCode】70. Climbing Stairs
- 4. Climbing Stairs(70)
- 5. 70. Climbing Stairs
- 6. 70.Climbing Stairs
- 7. LeetCode 70 Climbing Stairs
- 8. 【Leetcode】70. Climbing Stairs
- 9. 70. Climbing Stairs QuestionEditorial Solution
- 10. 【leetcode】70. 爬樓梯( Climbing Stairs )
- 更多相關文章...
- • Scala 高階函數 - Scala教程
- • ionic 平臺 - ionic 教程
- • 爲了進字節跳動，我精選了29道Java經典算法題，帶詳細講解
- • Spring Cloud 微服務實戰(三) - 服務註冊與發現
相關標籤/搜索
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。
歡迎關注本站公眾號,獲取更多信息
相關文章
- 1. leetcode【70】Climbing Stairs
- 2. LeetCode 70. Climbing Stairs
- 3. 【LeetCode】70. Climbing Stairs
- 4. Climbing Stairs(70)
- 5. 70. Climbing Stairs
- 6. 70.Climbing Stairs
- 7. LeetCode 70 Climbing Stairs
- 8. 【Leetcode】70. Climbing Stairs
- 9. 70. Climbing Stairs QuestionEditorial Solution
- 10. 【leetcode】70. 爬樓梯( Climbing Stairs )