满足不等式的最大值

/*
 * Solution using Java Streams:
 * While Java Streams are not ideally suited for this problem due to the need for efficient range-based updates,
 * we can still use them to structure the code and filter points within the range k.
 */
import java.util.*;
import java.util.stream.*;

public class MaxValueStream {
    public int findMaxValue(int[][] points, int k) {
        int maxValue = Integer.MIN_VALUE;
        for (int j = 0; j < points.length; j++) {
            final int xj = points[j][0];
            final int yj = points[j][1];
            maxValue = Math.max(maxValue,
                    Arrays.stream(points, 0, j)
                            .filter(p -> xj - p[0] <= k)
                            .mapToInt(p -> p[1] + yj + Math.abs(p[0] - xj))
                            .max()
                            .orElse(Integer.MIN_VALUE));
        }
        return maxValue;
    }
}