【Leetcode_easy】1137. N-th Tribonacci Number

problem

1137. N-th Tribonacci Number

solution:

class Solution {
public:
    int tribonacci(int n) {
        if(n==) return ;
        if(n== || n==) return ;
        int t0 = , t1 = , t2 = , t3 = ;
        for(int i=; i<=n; i++)
        {
            t3 = t0+t1+t2;
            t0 = t1;
            t1 = t2;
            t2 = t3;
        }
        return t3;
    }
};

 

 

参考

1. Leetcode_easy_1137. N-th Tribonacci Number;

完