Longest Subarray With Bounded Element Gap

Given an integer array `values` and a non-negative integer `gapLimit`, find the length of the longest contiguous subarray such that the difference between any two elements within the subarray (i.e., `max - min`) is at most `gapLimit`.

**Example 1:**
```
Input: values = [8, 2, 4, 7, 3, 5], gapLimit = 3
Output: 3
Explanation: The subarray [2, 4, 3] has max=4, min=2, difference=2 ≤ 3. Length = 3.
[4, 7, 3] has max=7, min=3, difference=4 > 3.
[3, 5] has difference 2, length 2.
Best is length 3.
```

**Example 2:**
```
Input: values = [10, 10, 10, 10], gapLimit = 0
Output: 4
Explanation: All elements are equal, so max - min = 0 for the entire array.
```