题解 | #斐波那契数列#
斐波那契数列
http://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3
class Solution { public: int Fibonacci(int n) {
if(n<=2) return 1;
int first = 1;
int second= 1;
int sum = 0;
for(int i=3;i<=n;i++)
{
sum = second + first;
first = second;
second = sum ;
}
return sum;
}
};
投递快手等公司7个岗位