描述
假设你正在爬楼梯,需要n步你才能到达顶部。但每次你只能爬一步或者两步,你能有多少种不同的方法爬到楼顶部?
样例
Example 1:
Input: n = 3
Output: 3
Explanation:
1) 1, 1, 1
2) 1, 2
3) 2, 1
total 3.
Example 2:
Input: n = 1
Output: 1
Explanation:
only 1 way.
代码部分
public class Solution {
/**
* @param n: An integer
* @return: An integer
*/
public int climbStairs(int n) {
// write your code here
if(n == 0) return 0;
else if(n == 1) return 1;
else if(n == 2) return 2;
else{
int a = 1, b =2, c = 0;
for (int i = 0; i < n - 2; i++ ){
c = a + b; a = b;b = c;
}
return c;
}
}
}
补充说明
动态规划