知道斐波拉契數列的規律便可。編程
class Solution { public: int Fibonacci(int n) { int preNum = 1; int prePreNum = 0; int result = 0; if(n == 0) return 0; if(n == 1) return 1; for(int i = 2;i <= n;++i){ //這是關鍵! result = preNum + prePreNum; prePreNum = preNum; preNum = result; } return result; } };
注意斐波那契數列的應用。spa