599. Minimum Index Sum of Two Lists
来源:互联网 发布:哔哩哔哩直播软件下载 编辑:程序博客网 时间:2024/05/17 23:32
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.
class Solution { public String[] findRestaurant(String[] list1, String[] list2) { Map<String, Integer> map = new HashMap<>(); List<String> res = new LinkedList<>(); int minSum = Integer.MAX_VALUE; for (int i=0;i<list1.length;i++){ map.put(list1[i], i); } for (int i=0;i<list2.length;i++) { Integer j = map.get(list2[i]); if (j != null && i + j <= minSum) { if (i + j < minSum) { res = new LinkedList<>(); minSum = i+j; } res.add(list2[i]); } } return res.toArray(new String[res.size()]); }}
- 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
- 599. Minimum Index Sum of Two Lists
- 599. Minimum Index Sum of Two Lists
- 599Minimum Index Sum of Two Lists
- [leetcode] 599. Minimum Index Sum of Two Lists
- leetcode 599. Minimum Index Sum of Two Lists
- leetode.599. Minimum Index Sum of Two Lists
- LeetCode 599. Minimum Index Sum of Two Lists(map,unordered_map)
- 599. Minimum Index Sum of Two Lists的C++解法
- LeetCode-599. Minimum Index Sum of Two Lists
- 推荐系统中基于深度学习的混合协同过滤模型
- MySql终端命令
- 无符号数和有符号数(二) -- 反码、移码表示法
- Vue开发:顶端粘滞效果实现
- 安卓“倒计时”的代码
- 599. Minimum Index Sum of Two Lists
- python连接mysql数据库 案例 查看数据 注意细节
- Hadoop学习
- makefile中.PHNOY的用法
- Android 实现fragment懒加载
- Creat_average_shape_model.hdev例程相关学习(一)
- Context Provider
- runit 快速入门
- Android设置软键盘弹出时不挤压当前布局