/
WordSubsets.java
41 lines (34 loc) · 1.08 KB
/
WordSubsets.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
39
40
41
// https://leetcode.com/problems/word-subsets/
class Solution {
public List<String> wordSubsets(String[] words1, String[] words2) {
int[] maxCounts = new int[26];
List<String> res = new ArrayList<>();
for (String word: words2) {
int[] freq = freqOf(word);
for (int i = 0; i < 26; i++) {
maxCounts[i] = Math.max(maxCounts[i], freq[i]);
}
}
for (String word: words1) {
int[] freq = freqOf(word);
boolean isValid = true;
for (int i = 0; i < 26; i++) {
if (freq[i] == 0 && maxCounts[i] != 0 || maxCounts[i] > freq[i]) {
isValid = false;
break;
}
}
if (isValid) {
res.add(word);
}
}
return res;
}
int[] freqOf(String word) {
int[] freq = new int[26];
for (char c: word.toCharArray()) {
freq[c - 'a']++;
}
return freq;
}
}