题目大意:每次只能上一级或者两级台阶,求上n级台阶的方法个数
分析:dp。(btw这道题是有名的斐波那契数列,很多面试都会考,要熟记)
状态:dp[i]——上到第i级台阶的方法个数
初始化:dp[1]=1 dp[2]=2
结果:dp[n]
状态转移方程:dp[i]=dp[i-1]+dp[i-2]
代码:
方法一:dp
class Solution {
public:
int climbStairs(int n) {
if (n == 1) return 1;
int dp[n+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];
}
};
方法二:斐波那契数列转载自https://leetcode.com/problems/climbing-stairs/solution/
public class Solution {
public int climbStairs(int n) {
if (n == 1) {
return 1;
}
int first = 1;
int second = 2;
for (int i = 3; i <= n; i++) {
int third = first + second;
first = second;
second = third;
}
return second;
}
}