Implement dynamic programming solution for tribonacci and fix index calculation in sequence matching

This commit is contained in:
2025-12-06 00:03:28 +08:00
parent cf633352b5
commit 7ae0aeb744
2 changed files with 13 additions and 2 deletions

View File

@@ -4,4 +4,14 @@
#include <solution/1137.h>
int tribonacci(int n)
{
int dp[n + 1];
dp[0] = 0;
if (n >= 1)
dp[1] = 1;
if (n >= 2)
dp[2] = 1;
for (int i = 3; i <= n; i++)
dp[i] = dp[i - 3] + dp[i - 2] + dp[i - 1];
return dp[n];
}