-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathword-subsets.js
56 lines (48 loc) · 882 Bytes
/
word-subsets.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
/**
* @param {string[]} A
* @param {string[]} B
* @return {string[]}
*/
function wordSubsets(A, B) {
const maxFreqB = new Array(26).fill(0);
for (let b of B) {
const freqB = count(b);
for (let i = 0; i < 26; i++) {
maxFreqB[i] = Math.max(maxFreqB[i], freqB[i]);
}
}
const ans = [];
for (let a of A) {
const freqA = count(a);
if (compare(freqA, maxFreqB)) {
ans.push(a);
}
}
return ans;
}
/**
*
* @param {string} S
* @returns {number[]}
*/
function count(S) {
const freq = new Array(26).fill(0);
for (let i = 0; i < S.length; i++) {
freq[S[i].charCodeAt(0) - 'a'.charCodeAt(0)]++;
}
return freq;
}
/**
*
* @param {number[]} a
* @param {number[]} b
* @returns {boolean}
*/
function compare(a, b) {
for (let i = 0; i < 26; i++) {
if (a[i] < b[i]) {
return false;
}
}
return true;
}