题目:https://leetcode-cn.com/problems/climbing-stairs/submissions/
答案:
动态规划:
f(n) = f(n-1)+f(n-2)
public int climbStairs(int n) {
if(n==1) return 1;
if(n==2) return 2;
int f1 = 1, f2 = 1+1;
int result = 0;
for(int i=3;i<=n;i++){
result = f2 + f1;
f1 = f2;
f2=result;
}
return result;
}