LeetCode-599. Minimum Index Sum of Two Lists
来源:互联网 发布:ubuntu 命令行 菱形 编辑:程序博客网 时间:2024/06/05 20:36
Suppose Andy and Doris want to choose a restaurant for dinner, and they both have a list of favorite restaurants represented by strings.
You need to help them find out their common interest with the least list index sum. If there is a choice tie between answers, output all of them with no order requirement. You could assume there always exists an answer.
Example 1:
Input:["Shogun", "Tapioca Express", "Burger King", "KFC"]["Piatti", "The Grill at Torrey Pines", "Hungry Hunter Steakhouse", "Shogun"]Output: ["Shogun"]Explanation: The only restaurant they both like is "Shogun".
Example 2:
Input:["Shogun", "Tapioca Express", "Burger King", "KFC"]["KFC", "Shogun", "Burger King"]Output: ["Shogun"]Explanation: The restaurant they both like and have the least index sum is "Shogun" with index sum 1 (0+1).
Note:
- The length of both lists will be in the range of [1, 1000].
- The length of strings in both lists will be in the range of [1, 30].
- The index is starting from 0 to the list length minus 1.
- No duplicates in both lists.
-------------------------------------------------------------------------------------------------------------------------------------------------------------
这道题属于数组找相同字符串,可以利用集合来进行操作实现。
public class Solution { public String[] findRestaurant(String[] list1, String[] list2) { Map<String,Integer> map = new HashMap();List<String> list = new ArrayList<>();int minIndex =2000;for(int i=0;i<list1.length;i++){map.put(list1[i],i);}for(int j=0;j<list2.length;j++){if(map.containsKey(list2[j])){int indexOfMap = map.get(list2[j]);if(indexOfMap+j == minIndex){list.add(list2[j]);}else if(indexOfMap+j < minIndex){list.clear();list.add(list2[j]);minIndex = indexOfMap+j;}}}String [] result = new String[list.size()]; for(int k =0;k<list.size();k++){ result[k] = list.get(k); } return result; }}
阅读全文
0 0
- [leetcode] 599. Minimum Index Sum of Two Lists
- leetcode 599. Minimum Index Sum of Two Lists
- LeetCode 599. Minimum Index Sum of Two Lists(map,unordered_map)
- LeetCode-599. Minimum Index Sum of Two Lists
- Leetcode-599.Minimum Index Sum of Two Lists
- leetcode 599. Minimum Index Sum of Two Lists
- [LeetCode]599. Minimum Index Sum of Two Lists
- LeetCode 599. Minimum Index Sum of Two Lists
- 【LeetCode】599. Minimum Index Sum of Two Lists
- leetcode 599. Minimum Index Sum of Two Lists
- 599. Minimum Index Sum of Two Lists
- 599. Minimum Index Sum of Two Lists
- 599. Minimum Index Sum of Two Lists
- 599. Minimum Index Sum of Two Lists
- 599. Minimum Index Sum of Two Lists
- 599. Minimum Index Sum of Two Lists
- 599. Minimum Index Sum of Two Lists
- 599. Minimum Index Sum of Two Lists
- 5个理由让你选择Go,抛弃Python
- 深入理解DIP、IoC、DI以及IoC容器
- sourceinsight破解的关键点
- Git push与pull的默认行为
- CFCA与亚洲诚信联合力推国产SSL证书服务
- LeetCode-599. Minimum Index Sum of Two Lists
- 保护基于类层次而非对象层次
- ZT:教程|手把手教你在Unity中实现小地图(Minimap)
- bmp图片处理,好好分析
- android输入框内容改变的监听事件
- 欢迎使用CSDN-markdown编辑器
- angular 双向数据绑定 初始化页面hide后,就绑定失效了
- orcale--case when
- 运行程序出现Illegal instruction的定位和思考------又是printf string惹的火