https://leetcode-cn.com/problems/climbing-stairs/
状态表示: f[i]表示到i阶楼梯的方案数
状态转移: f[i]=f[i-1]+f[i-2]
class Solution {
public:
int climbStairs(int n)
{
int f[100010]={0,1,2};
for(int i=3;i<=n;i++) f[i]=f[i-1]+f[i-2];
return f[n];
}
};