g0001_0100.s0045_jump_game_ii.Solution.dart Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

There is a newer version: 1.8

// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Greedy
// #Algorithm_II_Day_13_Dynamic_Programming #Dynamic_Programming_I_Day_4
// #Big_O_Time_O(n)_Space_O(1) #2024_10_04_Time_335_ms_(81.58%)_Space_148.6_MB_(76.32%)

import 'dart:math';

class Solution {
  int jump(List nums) {
    int length = 0;
    int maxLength = 0;
    int minJump = 0;

    for (int i = 0; i < nums.length - 1; ++i) {
      length--;
      maxLength--;
      maxLength = max(maxLength, nums[i]);

      if (length <= 0) {
        length = maxLength;
        minJump++;
      }

      if (length >= nums.length - i - 1) {
        return minJump;
      }
    }

    return minJump;
  }
}