-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfindRestaurant.java
More file actions
28 lines (26 loc) · 1.06 KB
/
findRestaurant.java
File metadata and controls
28 lines (26 loc) · 1.06 KB
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
import java.util.*;
public class findRestaurant{
public static void main(String args[]){
String list1[]={"Shogun", "Tapioca Express", "Burger King", "KFC"};
String list2[]={"KFC", "Shogun", "Burger King"};
String result[]=find_restaurant(list1,list2);
System.out.println(Arrays.toString(result));
}
public static String[] find_restaurant(String[] list1, String[] list2) {
HashMap < Integer, List < String >> map = new HashMap < > ();
for (int i = 0; i < list1.length; i++) {
for (int j = 0; j < list2.length; j++) {
if (list1[i].equals(list2[j])) {
if (!map.containsKey(i + j))
map.put(i + j, new ArrayList < String > ());
map.get(i + j).add(list1[i]);
}
}
}
int min_index_sum = Integer.MAX_VALUE;
for (int key: map.keySet())
min_index_sum = Math.min(min_index_sum, key);
String[] res = new String[map.get(min_index_sum).size()];
return map.get(min_index_sum).toArray(res);
}
}