g0001_0100.s0045_jump_game_ii.Solution.kt Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-kotlin Show documentation
Show all versions of leetcode-in-kotlin Show documentation
Kotlin-based LeetCode algorithm problem solutions, regularly updated
package g0001_0100.s0045_jump_game_ii
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Greedy
// #Algorithm_II_Day_13_Dynamic_Programming #Dynamic_Programming_I_Day_4
// #2022_08_29_Time_227_ms_(98.14%)_Space_37.3_MB_(100.00%)
class Solution {
fun jump(nums: IntArray): Int {
var length = 0
var maxLength = 0
var minJump = 0
for (i in 0 until nums.size - 1) {
length--
maxLength--
maxLength = Math.max(maxLength, nums[i])
if (length <= 0) {
length = maxLength
minJump++
}
if (length >= nums.size - i - 1) {
return minJump
}
}
return minJump
}
}