Frog Jump Dynamic Program Solution in Java IDE. Vs Code. Full Code.

Publicado el: 21 noviembre 2022
en el canal de: DailyCodeUpdates

181

Hi Everyone ,
Please do like and subscribe

Please watch this at 1.5X speed. :-)

There is a frog on the 1st step of an N stairs long staircase. The frog wants to reach the Nth stair. HEIGHT[i] is the height of the (i+1)th stair.If Frog jumps from ith to jth stair, the energy lost in the jump is given by |HEIGHT[i-1] - HEIGHT[j-1] |.In the Frog is on ith staircase, he can jump either to (i+1)th stair or to (i+2)th stair. Your task is to find the minimum total energy used by the frog to reach from 1st stair to Nth stair.

For Example
If the given ‘HEIGHT’ array is [10,20,30,10], the answer 20 as the frog can jump from 1st stair to 2nd stair (|20-10| = 10 energy lost) and then a jump from 2nd stair to last stair (|10-20| = 10 energy lost). So, the total energy lost is 20.

En esta página del sitio puede ver el video en línea Frog Jump Dynamic Program Solution in Java IDE. Vs Code. Full Code. de Duración hora minuto segunda en buena calidad , que subió el usuario DailyCodeUpdates 21 noviembre 2022, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 181 veces y le gustó 3 a los espectadores. Disfruta viendo!

262