小白的进阶之路 -- DP

动态规划–斐波那契

T3 = T2 + T1 + T0;

T0 T1 T2 T3 T4 T5 T6
0 1 1 2 4 7 13
X Y Z
X Y Z
X Y Z
X Y Z
X Y Z

n<3的时候 只有 t0 = 0, t1 = 1, t2 = 1

#include<stdio.h>

int tribonacci(int n){
    if(n < 3) return (n == 0) ? 0 : 1;
    int x = 0, y = 1, z = 1,tmp;
        for(int i = 3; i <= n; i++)
        {
            tmp = x + y + z;
            x = y;
            y = z;
            z = tmp;
        }
        return z;
}