Skip to content

Commit e3fddf9

Browse files
committed
Runtime: 4 ms (Top 82.54%) | Memory: 72.1 MB (Top 7.10%)
1 parent 8456097 commit e3fddf9

File tree

1 file changed

+7
-7
lines changed

1 file changed

+7
-7
lines changed
Original file line numberDiff line numberDiff line change
@@ -1,22 +1,22 @@
1+
// Runtime: 4 ms (Top 82.54%) | Memory: 72.1 MB (Top 7.10%)
12
class Solution {
23
public int numSubarrayBoundedMax(int[] nums, int left, int right) {
34
int res = 0;
4-
5+
56
int s = -1;
67
int e = -1;
7-
8+
89
for(int i=0;i<nums.length;i++){
9-
10+
1011
if(nums[i] >= left && nums[i] <= right){
1112
e = i;
1213
}else if(nums[i] > right){
1314
e = s = i;
1415
}
15-
16+
1617
res += (e - s);
1718
}
18-
19-
19+
2020
return res;
2121
}
22-
}
22+
}

0 commit comments

Comments
 (0)