Max Value of Equation
You are given an array points containing the coordinates of points on a 2D plane, sorted by the x-values, where points[i] = [xi, yi] such that xi < xj for all 1 <= i < j <= points.length. You are also given an integer k.
Return the maximum value of the equation yi + yj + |xi - xj| where |xi - xj| <= k and 1 <= i < j <= points.length.
It is guaranteed that there exists at least one pair of points that satisfy the constraint |xi - xj| <= k.
Example 1
Input
points = [[1,3],[2,0],[5,10],[6,-10]], k = 1Output
4The first two points give 4, the third and fourth points give 1, and no other pairs satisfy the condition, so the maximum is 4.
Example 2
Input
points = [[0,0],[3,0],[9,2]], k = 3Output
3Only the first two points have an absolute difference of 3 or less in x-values, giving 0 + 0 + |0 - 3| = 3.
Constraints
- 2 <= points.length <= 10^5
- points[i].length == 2
- -10^8 <= xi, yi <= 10^8
- 0 <= k <= 2 * 10^8
- xi < xj for all 1 <= i < j <= points.length
- xi form a strictly increasing sequence.