增量元素之间的最大差值

// Solution for finding the maximum difference using Java Streams
// Streams are used to find the max and min values efficiently
// Given an array nums, find the maximum difference nums[j] - nums[i] where 0 <= i < j < n and nums[i] < nums[j]
// If no such pair exists, return -1

import java.util.stream.IntStream;

public class Solution {
    public int maximumDifference(int[] nums) {
        int n = nums.length;
        int minValue = nums[0];
        int maxDifference = IntStream.range(1, n)
            .map(j -> nums[j] > minValue ? nums[j] - (minValue = Math.min(minValue, nums[j])) : -1)
            .max()
            .orElse(-1);
        return maxDifference;
    }
}