Small details in the implementation of Fibonnacci using Dynamic Programming.

[duongtq]

// My code just improves a little
// Feel free to ask me questions

function dp_ficbo(n)
{
var val = [];
for ( let i = 0; i <= n; i++)
{
val[i] = 0;
}
if ( n == 1 || n == 2)
{
return 1;
}
else
{
val[1] = 1;
val[2] = 2;

	for ( let i = 3; i <= n; i++ )
	{
		val[i] = val[i - 1] + val[i - 2];
	}
}

return val[n - 1];

}
console.log(dp_ficbo(20));

[ms10398]

Your fork is too old so it is showing old commits also can you rebase or update your fork please