剑指offer7 斐波那契数列

提前算好就ok了,因为到第49个就超出int类型的极限了,所以只需要算48就ok了.

#include "iostream"
#include "stdio.h"
using namespace std;

class Solution {
public:
    int Fibonacci(int n) {
    	int num[48];
    	num[0] = 0;
    	num[1] = 1;
    	num[2] = 1;
    	for(int i=3;i<48;i++)
    	{
    		num[i] = num[i-1]+num[i-2];
    	}
    	return num[n];
    }
};

int main()
{
	Solution test;
	int result;
	result = test.Fibonacci(48);

	cout<<result<<endl;
}