-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy pathJM_67258.java
More file actions
33 lines (28 loc) · 859 Bytes
/
JM_67258.java
File metadata and controls
33 lines (28 loc) · 859 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
import java.util.*;
// 모든 보석을 하나 이상 포함하는 가장 짧은 구간
class JM_67824 {
public static int[] findShortest(String[] gems, int gemCount) {
int[] answer = {-1, -1};
Map<String, Integer> map = new HashMap<>();
int l = 0, r = 0;
while(l < gems.length && r < gems.length) {
map.put(gems[r], map.getOrDefault(gems[r], 0) + 1);
while(map.size() == gemCount && l <= r) {
if(answer[0] == -1 || (answer[1] - answer[0]) > (r - l)) {
answer[0] = l + 1;
answer[1] = r + 1;
}
if(map.get(gems[l]) == 1) map.remove(gems[l]);
else map.put(gems[l], map.get(gems[l]) - 1);
l++;
}
r++;
}
return answer;
}
public static int[] solution(String[] gems) {
Set<String> set = new HashSet<String>(Arrays.asList(gems));
int gemCount = set.size();
return findShortest(gems, gemCount);
}
}