-
Notifications
You must be signed in to change notification settings - Fork 0
/
PG_카카오_불량사용자.java
59 lines (51 loc) · 1.61 KB
/
PG_카카오_불량사용자.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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
package week12;
import java.util.*;
public class PG_카카오_불량사용자 {
static int answer;
static HashSet<HashSet<String>> result;
public static void main(String[] args) {
// String[] user_id = {"frodo", "fradi", "crodo", "abc123", "frodoc"};
// String[] banned_id = {"fr*d*", "abc1**"};
String[] user_id = {"frodo", "fradi", "crodo", "abc123", "frodoc"};
String[] banned_id = {"fr*d*", "*rodo", "******", "******"};
int len1 = banned_id.length;
int len2 = user_id.length;
ArrayList<String> candidate[] = new ArrayList[len1];
for (int i = 0; i < len1; i++) {
candidate[i] = new ArrayList<String>();
}
for (int i = 0; i < len1; i++) {
String str1 = banned_id[i];
for (int j = 0; j < len2; j++) {
String str2 = user_id[j];
if (str1.length() != str2.length()) continue;
boolean flag = true;
for (int k = 0, len = str1.length(); k < len; k++) {
if (str1.charAt(k) == '*') continue;
if (str1.charAt(k) != str2.charAt(k)) {
flag = false; break;
}
}
if (flag) candidate[i].add(str2);
}
}
result = new HashSet<HashSet<String>>();
permut(candidate, len1, 0, new String[len1]);
answer = result.size();
System.out.println(answer);
}
private static void permut(ArrayList<String>[] candidate, int N, int cnt, String[] list) {
if (cnt == N) {
HashSet<String> set = new HashSet<String>();
for (int i = 0; i < N; i++) {
set.add(list[i]);
}
if (set.size() == N) result.add(set);
return;
}
for (int i = 0; i < candidate[cnt].size(); i++) {
list[cnt] = candidate[cnt].get(i);
permut(candidate, N, cnt+1, list);
}
}
}