-
Notifications
You must be signed in to change notification settings - Fork 368
/
Copy pathMinimum Window Substring.java
38 lines (38 loc) · 1.33 KB
/
Minimum Window Substring.java
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
34
35
36
37
38
class Solution {
public String minWindow(String s, String t) {
Map<Character, Integer> map = new HashMap<>();
for (char c : t.toCharArray()) {
map.put(c, map.getOrDefault(c, 0) + 1);
}
int targetSize = map.size();
int start = 0;
int minLength = Integer.MAX_VALUE;
int minStart = -1;
int minEnd = -1;
int n = s.length();
for (int i = 0; i < n; i++) {
if (map.containsKey(s.charAt(i))) {
map.put(s.charAt(i), map.get(s.charAt(i)) - 1);
if (map.get(s.charAt(i)) == 0) {
targetSize--;
}
}
while (start <= i && targetSize == 0) {
int currLength = i - start;
if (minLength > currLength) {
minLength = currLength;
minStart = start;
minEnd = i + 1;
}
if (map.containsKey(s.charAt(start))) {
map.put(s.charAt(start), map.get(s.charAt(start)) + 1);
if (map.get(s.charAt(start)) == 1) {
targetSize++;
}
}
start++;
}
}
return minLength == Integer.MAX_VALUE ? "" : s.substring(minStart, minEnd);
}
}