LEETCODE--Intersection of Two Arrays II
来源:互联网 发布:电子相册什么软件好 编辑:程序博客网 时间:2024/06/06 12:29
Given two arrays, write a function to compute their intersection.
Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].
Note:
Each element in the result should appear as many times as it shows in both arrays.
The result can be in any order.
Follow up:
What if the given array is already sorted? How would you optimize your algorithm?
What if nums1’s size is small compared to nums2’s size? Which algorithm is better?
What if elements of nums2 are stored on disk, and the memory is limited such that you cannot load all elements into the memory at once?
方法一:
初次使用map这种key-value对应的容器。
参考c++ map的使用
class Solution {public: vector<int> intersect(vector<int>& nums1, vector<int>& nums2) { int len1 = nums1.size(); map<int, int> dict; for(int i = 0; i < len1; i++){ ++dict[nums1[i]]; } int len2 = nums2.size(); vector<int> vec; for(int j = 0; j < len2; j++){ if(dict[nums2[j]] != 0){ vec.push_back(nums2[j]); dict[nums2[j]]--; } } return vec; }};
方法二:
先排序后利用two point进行查找
class Solution {public: vector<int> intersect(vector<int>& nums1, vector<int>& nums2) { int len1 = nums1.size(); int len2 = nums2.size(); vector<int> vec; sort(nums1.begin(),nums1.end()); sort(nums2.begin(),nums2.end()); int i = 0; int j = 0; while(i < len1 && j < len2){ if(nums1[i] == nums2[j]){ vec.push_back(nums1[i]); i++; j++; }else if(nums1[i] > nums2[j]){ j++; }else{ i++; } } return vec; }};
0 0
- [LeetCode] Intersection of Two Arrays II
- LeetCode Intersection of Two Arrays II
- LeetCode 350. Intersection of Two Arrays II
- LeetCode:Intersection of Two Arrays II
- leetcode.350. Intersection of Two Arrays II
- LeetCode 350:Intersection of Two Arrays II
- [leetcode] 350. Intersection of Two Arrays II
- Leetcode 350. Intersection of Two Arrays II
- leetcode 350. Intersection of Two Arrays II
- leetcode Intersection of Two Arrays II
- Leetcode 350. Intersection of Two Arrays II
- [python][leetcode]Intersection of Two Arrays II
- [leetcode] 350. Intersection of Two Arrays II
- leetcode 350. Intersection of Two Arrays II
- 【leetcode】Intersection of Two Arrays II
- 【leetcode】350. Intersection of Two Arrays II
- leetcode之Intersection of Two Arrays II
- [Leetcode] 350. Intersection of Two Arrays II
- ARC下OC对象和CF对象之间的桥接(bridge)
- (函数题)4-5 求自定类型元素的最大值
- Django文件上传机制详解
- 使用struts配置拦截器
- zhang
- LEETCODE--Intersection of Two Arrays II
- 键值的依赖关系
- 文件和目录的维护
- 【python】List与string转化--test_veh.py代码
- 杂务 洛谷1113 spfa最长路
- dispatchTouchEvent, interceptTouchEvent,onTouchEvent 详细分析
- JavaWeb_内省(Instrospector)
- 使用ALAssetsLibrary读取所有照片
- 如何理解LeakCanary的错误信息