solved: Jump Game II

lambiengcode · lambiengcode · commit 400c3cb43b69 · 2023-07-17T15:43:48.000+07:00
diff --git a/README.md b/README.md
@@ -26,6 +26,7 @@
   - [3 Sum](#3-sum)
   - [3 Sum Closest](#3-sum-closest)
   - [Letter combinations of a phone number](#letter-combinations-of-a-phone-number)
+  - [Jump Game II](#jump-game-ii)
 
 ### String to Int - Atoi
 
@@ -719,4 +720,26 @@ void lookupChar(
     }
   }
 }
+```
+
+### Jump Game II
+
+```dart
+int jump(List<int> nums) {
+  if (nums.isEmpty) return 0;
+
+  int result = 0;
+  int maxNumber = 0;
+  int cur = 0;
+
+  for (var i = 0; i < nums.length - 1; i++) {
+    maxNumber = max(maxNumber, i + nums[i]);
+    if (i == cur) {
+      result++;
+      cur = maxNumber;
+    }
+  }
+
+  return result;
+}
 ```
diff --git a/src/jump_game_2.dart b/src/jump_game_2.dart
@@ -0,0 +1,30 @@
+import 'dart:math';
+
+void main(List<String> args) {
+  List<List<int>> cases = [
+    [2, 3, 1, 1, 4],
+    [2, 3, 0, 1, 4]
+  ];
+
+  for (final testcase in cases) {
+    print(jump(testcase));
+  }
+}
+
+int jump(List<int> nums) {
+  if (nums.isEmpty) return 0;
+
+  int result = 0;
+  int maxNumber = 0;
+  int cur = 0;
+
+  for (var i = 0; i < nums.length - 1; i++) {
+    maxNumber = max(maxNumber, i + nums[i]);
+    if (i == cur) {
+      result++;
+      cur = maxNumber;
+    }
+  }
+
+  return result;
+}
