代码随想录：斐波那契数

class Solution {
public:
    int fib(int n) {
        vector<int> dp = vector<int>(32, 0);
        dp[0] = 0;
        dp[1] = 1;
        for (int i = 2; i <= n; i++) {
            dp[i] = dp[i - 1] + dp[i - 2];
        }
        return dp[n];
    }
};