forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.java
28 lines (28 loc) · 867 Bytes
/
Solution.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
class Solution {
public String minWindow(String s, String t) {
int[] need = new int[128];
int[] window = new int[128];
int m = s.length(), n = t.length();
for (int i = 0; i < n; ++i) {
++need[t.charAt(i)];
}
int cnt = 0, j = 0, k = -1, mi = 1 << 30;
for (int i = 0; i < m; ++i) {
++window[s.charAt(i)];
if (need[s.charAt(i)] >= window[s.charAt(i)]) {
++cnt;
}
while (cnt == n) {
if (i - j + 1 < mi) {
mi = i - j + 1;
k = j;
}
if (need[s.charAt(j)] >= window[s.charAt(j)]) {
--cnt;
}
--window[s.charAt(j++)];
}
}
return k < 0 ? "" : s.substring(k, k + mi);
}
}