-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
1170.java
42 lines (40 loc) · 1.39 KB
/
1170.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
42
__________________________________________________________________________________________________
class Solution {
public int[] numSmallerByFrequency(String[] queries, String[] words) {
int[] q = new int[queries.length], w = new int[words.length];
for (int i = 0; i < q.length; i++) {
q[i] = jisuan(queries[i]);
}
for (int i = 0; i < w.length; i++) {
w[i] = jisuan(words[i]);
}
Arrays.sort(w);
int[] ans = new int[q.length];
for (int i = 0; i < q.length; i++) {
int l = 0, r = w.length - 1;
while (l <= r) {
int mid = (l + r) / 2;
if (w[mid] <= q[i]) {
l = mid + 1;
}
else {
r = mid - 1;
}
}
ans[i] = w.length - l;
}
return ans;
}
private int jisuan(String str) {
int[] arr = new int[26];
for (char ch : str.toCharArray())
arr[ch - 'a']++;
for (int i = 0; i < 26; i++) {
if (arr[i] != 0)
return arr[i];
}
return 0;
}
}
__________________________________________________________________________________________________
__________________________________________________________________________________________________