1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
| class Solution {
public int longestWPI(int[] hours) {
int n = hours.length;
int ans = 0;
for (int i = 0; i < n; i++) {
int count = 0;
for (int j = i; j < n; j++) {
if (hours[j] > 8){
count = count + 1;
}else {
count = count - 1;
}
if (count > 0){
ans = Math.max(ans, j-i+1);
}
}
}
return ans;
}
}
|
