It has been 1142 days since the last update, the content of the article may be outdated.

此篇文章為我的解題紀錄，程式碼或許並不是很完善

Leetcode - 509. Fibonacci Number

解題思路

使用recursive的方法～一直呼叫自己直到n為1或是0

我滴程式碼

c++
1
2
3
4
5
6
7
8
9
10
11
class Solution {
public:
    int fib(int n) {
        if (n == 0)
            return 0;
        else if (n == 1)
            return 1;
        else
            return fib(n - 1) + fib(n - 2);
    }
};