LetCode 70. Climbing Stairs--动态规划-爬梯子--递归等解法

LeetCode 动态规划（Dynamic programming）系列题目:LeetCode 动态规划（Dynamic programming）系列题目

You are climbing a stair case. It takes n steps to reach to the top.

Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Note: Given n will be a positive integer.

Example 1:

Input: 2
Output: 2
Explanation: There are two ways to climb to the top.
1. 1 step + 1 step
2. 2 steps

Example 2:

Input: 3
Output: 3
Explanation: There are three ways to climb to the top.
1. 1 step + 1 step + 1 step
2. 1 step + 2 steps
3. 2 steps + 1 step

爬梯子，动态规划即可。
Python代码如下：

class Solution:def climbStairs(self, n: int) -> int:t=[1,2]for i in range(2,n):t.append(t[i-1]+t[i-2])return t[n-1]

java解法：

class Solution {public int climbStairs(int n) {int []dp=new int[n+1];if(n==1){return 1;}dp[1]=1;dp[2]=2;for (int i=3;i<=n;i++){dp[i]=dp[i-1]+dp[i-2];}return dp[n];}
}

python如果直接使用递归的话，会爆内存，使用缓存可以解决这个问题：

import functoolsclass Solution:@functools.lru_cache()def climbStairs(self, n: int) -> int:return self.climbStairs(n - 1) + self.climbStairs(n - 2) if n > 2 else 2 if n == 2 else 1

可以直接使用斐波那契公式，Java代码如下：

public class Solution {public int climbStairs(int n) {double sqrt5=Math.sqrt(5);double fibn=Math.pow((1+sqrt5)/2,n+1)-Math.pow((1-sqrt5)/2,n+1);return (int)(fibn/sqrt5);}
}

LetCode 70. Climbing Stairs--动态规划-爬梯子--递归等解法相关推荐

70. Climbing Stairs【leetcode】递归，动态规划，java，算法
You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb ...
【斐波那切数列】LeetCode 70. Climbing Stairs
LeetCode 70. Climbing Stairs 这是一道利用斐波那切数列求解的题目.求斐波那切数列有比较经典的4种方法 (1)递归法:复杂度太高 (2)迭代法:时间复杂度为O(n)O(n)O ...
[勇者闯LeetCode] 70. Climbing Stairs
[勇者闯LeetCode] 70. Climbing Stairs Description You are climbing a stair case. It takes n steps to rea ...
70. Climbing Stairs
70. Climbing Stairs 1. 题目 You are climbing a stair case. It takes n steps to reach to the top. Each ...
[LeetCode]70.Climbing Stairs
[题目] You are climbing a stair case. It takes n steps to reach to the top. Each time you can either c ...
leetcode python3 简单题70. Climbing Stairs
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第七十题 (1)题目英文: You are climbing a stair ca ...
Leet Code OJ 70. Climbing Stairs [Difficulty: Easy]
题目: You are climbing a stair case. It takes n steps to reach to the top. Each time you can either cl ...
[leetcode 70]Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb ...
LeetCode#70 Climbing Stairs
Problem Definition: You are climbing a stair case. It takes n steps to reach to the top. Each time y ...

LetCode 70. Climbing Stairs--动态规划-爬梯子--递归等解法

LetCode 70. Climbing Stairs--动态规划-爬梯子--递归等解法相关推荐

最新文章

热门文章