1137. 第 N 个泰波那契数(c++/动态规划)

class Solution {
public:
    int tribonacci(int n) {
        if(n == 0)return 0;
        if(n == 1)return 1;
        if(n == 2)return 1;
        int a = 0,b = 1,c = 1,res;
        for(int i = 3;i <= n;i++){
            res = a + b + c;
            a = b;
            b = c;
            c = res;
        }
        return res;

    }
};