jump game - 45

Author: bibincnair

include/leeter/jump_game_45.hpp

@@ -0,0 +1,25 @@
+#include <vector>
+
+using std::vector;
+
+namespace jump_game_45 {
+  class Solution {
+  public:
+    int jump(vector<int>& nums) {
+      int curr_jump = 0;
+      int max_jump = 0;
+      int jump_count = 0;
+      for (int i = 0; i < nums.size() - 1; i++) {
+        max_jump = std::max(max_jump, i + nums[i]);
+        if (i == curr_jump) {
+          curr_jump = max_jump;
+          jump_count++;
+        }
+        if (curr_jump >= nums.size() - 1) {
+          break;
+        }
+      }
+      return jump_count;
+    }
+  };
+}  // namespace jump_game_45

test/source/test_jump_45.cpp

@@ -0,0 +1,24 @@
+#include <doctest/doctest.h>
+
+#include "leeter/jump_game_45.hpp"
+
+TEST_CASE("jump game: test case 1") {
+  vector<int> input = {2, 3, 1, 1, 4};
+  jump_game_45::Solution sol;
+  int output = sol.jump(input);
+  CHECK(output == 2);
+}
+
+TEST_CASE("jump game: test case 2") {
+  vector<int> input = {2, 3, 0, 1, 4};
+  jump_game_45::Solution sol;
+  int output = sol.jump(input);
+  CHECK(output == 2);
+}
+
+// TEST_CASE("jump game: test case 3") {
+//   vector<int> input = {2, 3, 0, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1};
+//   jump_game_45::Solution sol;
+//   int output = sol.jump(input);
+//   CHECK(output == 4);
+// }