其实就是斐波那契数列
f(n)=f(n-1)+f(n-2)
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;
}