跳跃游戏 II

/*
 * Problem: Given an array of non-negative integers nums, where each element represents the maximum jump length from that position. The goal is to reach the last index in the minimum number of jumps.
 * 
 * Approach using Java Streams:
 * Java Streams are generally used for functional operations on data. In this case, they are not ideal for such algorithmic implementation, but we can illustrate a conceptual approach.
 */
 
import java.util.stream.IntStream;
 
public class Solution {
    public int jump(int[] nums) {
        // Stream-based conceptual approach
        // Variables are mutable inside streams
        int[] jumps = {0}; // Number of jumps
        int[] currentEnd = {0}; // End of the current range
        int[] farthest = {0}; // Farthest we can reach
        
        IntStream.range(0, nums.length - 1).forEach(i -> {
            farthest[0] = Math.max(farthest[0], i + nums[i]); // Update farthest reach
            if (i == currentEnd[0]) { // If current index is at the end of the jump range
                jumps[0]++; // Increment jumps
                currentEnd[0] = farthest[0]; // Update currentEnd
            }
        });
        
        return jumps[0];
    }
}