斐波那契数列

class Solution {
public:
    /**
     * @param n: an integer
     * @return: an ineger f(n)
     */
    int fibonacci(int n) {
        int fib[n+1];
        for(int i=1;i<=n;i++){
            if(i<=2)
            {
               fib[i]=i-1;
            }
               else{
                fib[i]=fib[i-1]+fib[i-2];
               }
        }
        return fib[n];
    }
};