16.爬楼梯
题目内容:
代码及思路:
//斐波那契数列求解
int n;
cin >> n;
if (n == 0 || n == 1)
{
cout<<n<<endl;
}
int fibNMinusone = 1;
int fibNMinustwo = 0;
int fibN = 0;
for (int i = 1; i <= n; i++)
{
fibN = fibNMinusone + fibNMinustwo;
fibNMinustwo = fibNMinusone;
fibNMinusone = fibN;
}
cout << fibN << endl;