弟中弟的Leetcode总结——数组类(十)
题目描述
Climbing Stairs
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
思路
开始的时候想的是用回溯法进行递归,但是尝试提交了一次后发现超时了。因此想到了动态规划。
除了第一阶和第二阶楼梯以外,上到第n阶台阶的方法a(n)只有两种可能:从a(n-1)迈一步上去或者从a(n-2)迈两步上去。因此得到了状态转移方程a[i]=a[i-1]+a[i-2],且a[1]=1, a[2]=2.
代码(C)
int climbStairs(int n) {
int ans[1000];
ans[1]=1;
ans[2]=2;
for(int i=3;i<=n;i++){
ans[i]=ans[i-1]+ans[i-2];
}
return ans[n];
}