//斐波那契数列
class Solution {
public:
int climbStairs(int n) {
int first,second;
if(n==0)return 0;
if(n==1)return 1;
if(n==2)return 2;
first=0;second=1;
int temp;
for(int i=0;i<n;i++)
{
temp=second;
second+=first;
first=temp;
}
return second;
}
};