面试题10:斐波那契数列
实现斐波那契数列
long long Fibonacci(unsigned n)
{
int result[2] = {0, 1};
if(n<2) return result[n];
long long first = 0;
long long second = 1;
long long fibN = 0;
for(unsigned int i=2; i<=n; i++)
{
fibN = first + second;
first = second;
second = fibN;
}
}
面试题 9: 青蛙跳台阶
一只青蛙一次可以跳1级、2级,求该青蛙跳n级有多少种方法
f(n) = f(n-1) + f(n-2)
同斐波那契数列