-
Notifications
You must be signed in to change notification settings - Fork 0
/
Hearsee.java
44 lines (36 loc) · 911 Bytes
/
Hearsee.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
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.Scanner;
public class Hearsee {
public static void main(String[] args) {
solution1();
}
public static void solution1(){
Scanner scan = new Scanner(System.in);
int N;
int M;
String see[];
HashSet<String> hear = new HashSet<String>();
ArrayList<String> rs = new ArrayList<String>();
N = scan.nextInt();
M = scan.nextInt();
see = new String[M];
for (int i = 0; i < N; i++) {
hear.add(scan.next());
}
for (int i = 0; i < M; i++) {
see[i] = scan.next();
}
for (int i = 0; i < M; i++) {
if(hear.contains(see[i]) && !rs.contains(see[i]))
rs.add(see[i]);
}
Collections.sort(rs);
System.out.println(rs.size());
for (int i = 0; i < rs.size(); i++) {
System.out.println(rs.get(i));
}
scan.close();
}
}