-
Notifications
You must be signed in to change notification settings - Fork 0
/
76.minimum-window-substring.js
183 lines (182 loc) · 5.99 KB
/
76.minimum-window-substring.js
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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
/*
* @lc app=leetcode id=76 lang=javascript
*
* [76] Minimum Window Substring
*
* https://leetcode.com/problems/minimum-window-substring/description/
*
* algorithms
* Hard (34.56%)
* Likes: 5138
* Dislikes: 347
* Total Accepted: 435.4K
* Total Submissions: 1.2M
* Testcase Example: '"ADOBECODEBANC"\n"ABC"'
*
* Given a string S and a string T, find the minimum window in S which will
* contain all the characters in T in complexity O(n).
*
* Example:
*
*
* Input: S = "ADOBECODEBANC", T = "ABC"
* Output: "BANC"
*
*
* Note:
*
*
* If there is no such window in S that covers all characters in T, return the
* empty string "".
* If there is such window, you are guaranteed that there will always be only
* one unique minimum window in S.
*
*
*/
/* Time limit exceeded version */
// /**
// * @param {string} s
// * @param {string} t
// * @return {string}
// */
// var minWindow = function (s, t) {
// let dp = {};
// const n = s.length,
// targetN = t.length;
// if (n == 0 || targetN == 0) return "";
// let window = targetN - 1;
// let targetMap = new Map();
// for (let j = 0; j < targetN; j++) {
// let tempChar = t.charAt(j);
// setMap(targetMap, tempChar);
// }
// while (window <= n - 1) {
// let limit = n - window;
// for (let i = 0; i < limit; i++) {
// let windowRight = i + window;
// let map;
// if (dp[i]) {
// map = dp[i][windowRight - 1];
// let tempChar = s.charAt(windowRight);
// setMap(map, tempChar);
// dp[i][windowRight] = map;
// } else {
// dp[i] = {};
// map = new Map();
// dp[i][windowRight] = map;
// let subStr = s.substring(i, windowRight + 1);
// for (let j = 0; j < subStr.length; j++) {
// let tempChar = subStr.charAt(j);
// setMap(map, tempChar);
// }
// }
// let flag = true;
// for (let entry of targetMap) {
// let tempChar = entry[0];
// if (map.has(tempChar)) {
// let count = map.get(tempChar);
// if (count < entry[1]) {
// flag = false;
// continue;
// }
// } else {
// flag = false;
// continue;
// }
// }
// if (flag) return s.substring(i, windowRight + 1);
// }
// window++;
// }
// return "";
// };
// function setMap(map, char) {
// if (map.has(char)) {
// map.set(char, map.get(char) + 1);
// } else {
// map.set(char, 1);
// }
// }
// @lc code=start
/**
* @param {string} s
* @param {string} t
* @return {string}
*/
var minWindow = function (s, t) {
const n = s.length,
targetN = t.length;
if (n == 0 || targetN == 0) return "";
let left = 0,
right = 0;
let targetMap = new Map();
for (let j = 0; j < targetN; j++) {
let tempChar = t.charAt(j);
setMap(targetMap, tempChar);
}
let filteredS = [];
for (let i = 0; i < s.length; i++) {
let tempChar = s.charAt(i);
if (targetMap.has(tempChar)) {
let item = {};
item.index = i;
item.value = tempChar;
filteredS.push(item);
}
}
let countWindow = new Map();
for (let i = 0; i < right; i++) {
let tempChar = filteredS[i].value;
setMap(countWindow, tempChar);
}
let result = { length: Number.MAX_VALUE, left: -1, right: -1 };
while (right < filteredS.length) {
let tempChar = filteredS[right].value;
setMap(countWindow, tempChar);
while (judge(countWindow, targetMap)) {
let leftIndex = filteredS[left].index;
let rightIndex = filteredS[right].index;
if (rightIndex - leftIndex + 1 < result.length) {
result.length = rightIndex - leftIndex + 1;
result.left = leftIndex;
result.right = rightIndex;
}
let tempChar = filteredS[left].value;
countWindow.set(tempChar, countWindow.get(tempChar) - 1);
left++;
}
right++;
}
return result.length === Number.MAX_VALUE ? "" : s.substring(result.left, result.right + 1);
};
function setMap(map, char) {
if (map.has(char)) {
map.set(char, map.get(char) + 1);
} else {
map.set(char, 1);
}
}
function judge(countWindow, targetMap) {
let flag = true;
for (let entry of targetMap) {
let tempChar = entry[0];
if (countWindow.has(tempChar)) {
let count = countWindow.get(tempChar);
if (count < entry[1]) {
flag = false;
return false;
}
} else {
flag = false;
return false;
}
}
return true;
}
// @lc code=end
// ""ADOBECODEBANC"\n"""
// ""a"\n"a""
// ""bbaa"\n"aba""
// ""acbbaca"\n"aba""
// ""aaaaaaaaaaaabbbbbcdd"\n"abcdd""
// ""mspkqlcdmrwgrmcaytxilusinwgjvkdhfuuvfwarpxaglegjyftlblvqjezhqeovyisfgtxvqzdbdlmbthowumnfqomitbetlyzsrwpjvvkygycbfsyzgnfwbrhwunqilpadnrmkmzkvzowfhwgnjnmlftjbgzjtolwddlnrmymlmlsvhzltmzgtspvapetfqsjvfymrybelmxivwtokuueokbobhkgzerujqjcomgbadmxbhmociuquvhxereexvainlkcxsfxyrvzzjpbtjrqgynlrtpqrryedkiadqabhxcigslbdftkfhvxcmptdoagykjdajekgjsodgrgllqqulpwzfsdvsjtcszfddplojbrptyagqtaeiydnqgiksepmduqildxwfqmaqoghhilqiqfbxqlrucdzythlzgiexwepkmwuwjmeatfzjtqfxtewpohourutnajamhwiriotbwsnpismdxkunskhjedzeozsvvaofrhinzvcjoqpnbjavwjgcohjcgbadeokvytizomjeearhlrchdlkrstwbwwgamrxkkhkatvfavwhgqmqvzamrviutebutstfcbpcwmjwjigqyuittkhmfqhywkupcqvgrmkpbumkcuacokxhuevzwcatmwkqmhwfwjvxfjhhdkltuicpoxqlcsgqpshdafjwqevvpcesmpljzpyomqbqjjhabqddvozoswjhzobndowfdwvsnwiwhryihbmfqntkkculsxyyoxdrtyliwwgdnenvgbcypvkbzgmsemqujvlftzprvwwialfinjieetfgbtahhqbtlnagop"\n"zjlxtmibwxkfbraixbdx""