Update readme.md

Author: javadev

src/main/java/g0001_0100/s0045_jump_game_ii/readme.md

@@ -29,4 +29,38 @@ Return _the minimum number of jumps to reach index_ `n - 1`. The test cases are
 
 *   <code>1 <= nums.length <= 10<sup>4</sup></code>
 *   `0 <= nums[i] <= 1000`
-*   It's guaranteed that you can reach `nums[n - 1]`.
+*   It's guaranteed that you can reach `nums[n - 1]`.
+
+To solve the "Jump Game II" problem in Java with a `Solution` class, we can follow these steps:
+
+1. Define a `Solution` class.
+2. Define a method named `jump` that takes an array of non-negative integers `nums` as input and returns the minimum number of jumps required to reach the last index.
+3. Initialize variables `maxReach`, `steps`, and `end` to keep track of the maximum reachable position, the number of steps taken, and the end position respectively. Initialize `maxReach` to 0 and `end` to 0.
+4. Iterate through the array from index 0 to `nums.length - 2`:
+   - Update `maxReach` as the maximum of `maxReach` and `i + nums[i]`.
+   - If the current index `i` equals `end`, update `end` to `maxReach` and increment `steps`.
+5. Return `steps`.
+
+Here's the implementation:
+
+```java
+public class Solution {
+    public int jump(int[] nums) {
+        int maxReach = 0;
+        int steps = 0;
+        int end = 0;
+
+        for (int i = 0; i < nums.length - 1; i++) {
+            maxReach = Math.max(maxReach, i + nums[i]);
+            if (i == end) {
+                end = maxReach;
+                steps++;
+            }
+        }
+
+        return steps;
+    }
+}
+```
+
+This implementation provides a solution to the "Jump Game II" problem in Java. It calculates the minimum number of jumps required to reach the last index by iterating through the array and updating the maximum reachable position and the end position accordingly.