349_LeetCode_349 Intersection of Two Arrays 题解
来源:互联网 发布:淘宝广场舞服装春装 编辑:程序博客网 时间:2024/05/21 09:27
Description
Given two arrays, write a function to compute their intersection
Example:
Given nums1 = [1, 2, 2, 1]
, nums2 = [2, 2]
, return [2]
.
Note:
- Each element in the result must be unique.
- The result can be in any order.
返回两个列表的交集,有重复元素时,只返回一个。
解:
- 使用
hashset
,遍历其中一个数组,同时将该数组元素存入set1中。 - 之后,遍历另外一个数组,同时判断该数组遍历到的元素是否已经存在于set1中,若存在,则将该元素存入set2。
- 最后,将set2的元素存入结果数组。
java代码:
class Solution { public int[] intersection(int[] nums1, int[] nums2) { HashSet<Integer> set_1 = new HashSet<Integer>(); HashSet<Integer> set_2 = new HashSet<Integer>(); for (int i = 0; i < nums1.length; i++) { set_1.add(nums1[i]); } for (int i = 0; i < nums2.length; i++) { if (set_1.contains(nums2[i])){ set_2.add(nums2[i]); } } int[] res = new int[set_2.size()]; int i = 0; for (int x : set_2){ res[i] = x; i++; } return res; }}
阅读全文
1 0
- 349_LeetCode_349 Intersection of Two Arrays 题解
- Leetcode题解 349. Intersection of Two Arrays
- [349]Intersection of Two Arrays
- 349 Intersection of Two Arrays
- leetcode题解-349.Intersection of Two Arrays && 350. Intersection of Two Arrays II
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- 零基础入门深度学习(2)
- 通过继承HttpServlet来开发Servlet
- C# 上传文件到 Java(struts2)端示例
- POJ3678 Katu Puzzle(2-sat tanjar判矛盾)
- Tomcat未启动成功,显示No Spring WebApplicationInitializer types detected on classpath
- 349_LeetCode_349 Intersection of Two Arrays 题解
- web页面渲染
- java程序员面试宝典1
- CF272C Dima and Staircase(线段树/贪心)
- 学习资源推荐(不定期更新)
- 3494. 【NOIP2013模拟联考13】线段(segment) (2017.9B组)
- MySQL基础教程之存储过程
- Jzoj4614 字符串(待填)
- c\c++中的数据输入