斐波那契数列

class Solution {
public:
    int fib(int n) 
    {
        if (n == 0)
            return 0;
        if (n == 1)
            return 1;
        return fib(n - 1)+fib(n - 2);
    }
};