forked from shivanshjaitly/Hackerrank-java-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathJava Map.java
32 lines (26 loc) · 948 Bytes
/
Java Map.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
//Complete this code or write your own from scratch
import java.util.*;
import java.io.*;
class Solution {
public static void main(String [] args) throws Exception {
/* Read input and save as entries in a HashMap */
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.valueOf(br.readLine());
HashMap<String, Integer> map = new HashMap<>();
while (n-- > 0) {
String name = br.readLine();
int phone = Integer.valueOf(br.readLine());
map.put(name, phone);
}
/* Read each query and check if its in our HashMap */
String s;
while((s = br.readLine()) != null) {
if (map.containsKey(s)) {
System.out.println(s + "=" + map.get(s));
} else {
System.out.println("Not found");
}
}
br.close();
}
}