LeetCode 45: Jump Game II Solution

Problem Explanation

Explanation:

To solve this problem, we can use a greedy approach with dynamic programming. We iterate through the array and for each position, we calculate the farthest reachable position from that position. We keep track of the current farthest position and the next farthest position we can reach in the current jump. When the current position reaches the current farthest position, we increment the jump count and update the current farthest position with the next farthest position.

Time complexity: O(n)
Space complexity: O(1)

Solution Code

class Solution {
    public int jump(int[] nums) {
        int n = nums.length;
        int jumps = 0;
        int currentFarthest = 0;
        int nextFarthest = 0;

        for (int i = 0; i < n - 1; i++) {
            nextFarthest = Math.max(nextFarthest, i + nums[i]);
            if (i == currentFarthest) {
                jumps++;
                currentFarthest = nextFarthest;
            }
        }
        
        return jumps;
    }
}

Frequently Asked Questions

How to solve LeetCode 45 (Jump Game II)?

This page provides optimized solutions for LeetCode problem 45 (Jump Game II) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 45 (Jump Game II)?

The time complexity for LeetCode 45 (Jump Game II) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 45 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 45 in Java, C++, or Python.