JAVA_Minimum Index Sum of Two Lists

JAVA_Minimum Index Sum of Two Lists_LeetCode 599 풀이 class Solution { public String[] findRestaurant(String[] list1, String[] list2) { Map<String, Integer> map = new HashMap<>(); for (int i = 0; i < list1.length; i++) { map.put(list1[i], i); } List<String> mins = new ArrayList<>(); int minSum = Integer.MAX_VALUE; for (int i = 0; i < list2.length; i++) { String rest2 = list2[i]; if (map.containsKey(rest2)) { int sum = map.get(rest2) + i; if (sum < minSum) { mins = new ArrayList<>(); minSum = sum; ...

#JAVA #JAVA_LeetCode599 #JAVA_MinimumIndexSumofTwoLists #JAVA_MinimumIndexSumofTwoLists_LeetCode599 #MinimumIndexSumofTwoLists_LeetCode599

원문링크 : JAVA_Minimum Index Sum of Two Lists_LeetCode 599