Number of Subarrays with Bounded Maximum LeetCode solution in Java

1
class Solution {
2
  public int numSubarrayBoundedMax(int[] nums, int left, int right) {
3
    int res = 0;
4

5
    int s = -1;
6
    int e = -1;
7

8
    for (int i = 0; i < nums.length; i++) {
9

10
      if (nums[i] >= left && nums[i] <= right) {
11
        e = i;
12
      } else if (nums[i] > right) {
13
        e = s = i;
14
      }
15

16
      res += (e - s);
17
    }
18

19
    return res;
20
  }
21
}