[leetcode] 350. Intersection of Two Arrays II
来源:互联网 发布:网络包月电话 编辑:程序博客网 时间:2024/05/22 06:42
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.
Solution
Idea: hash table O(m + n) Space: O(m + n)
class Solution {public: vector<int> intersect(vector<int>& nums1, vector<int>& nums2) { vector<int> ret; unordered_map<int,int> h; for(int i=0; i<nums1.size();i++) ++h[nums1[i]]; for(int j=0; j<nums2.size();j++){ if(h[nums2[j]]>0){ ret.push_back(nums2[j]); h[nums2[j]]--; } } return ret; }};
Solution: O(max(m, n) log(max(m, n))) Space: O(m + n)
class Solution {public: vector<int> intersect(vector<int>& nums1, vector<int>& nums2) { vector<int> ret; sort(nums1.begin(), nums1.end()); sort(nums2.begin(), nums2.end()); int i = 0,j = 0; while (i<nums1.size() && j<nums2.size()){ if (nums1[i]==nums2[j]){ ret.push_back(nums1[i]); i++; j++; } else if (nums1[i]>nums2[j]) j++; else i++; } return ret; }};
0 0
- 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 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】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-350. Intersection of Two Arrays II
- leetcode 350. Intersection of Two Arrays II
- [leetcode]350. Intersection of Two Arrays II
- html,XPath 学习笔记
- php原本是浅克隆
- Hibernate的原理和作用
- AndroidStudio集成极光推送SDK
- Volley框架简介
- [leetcode] 350. Intersection of Two Arrays II
- leecode_210 Course Schedule II
- Java线程安全问题,方法及内存模型
- leetcode #68 in cpp
- oracle游标——(一)
- Technical Artist 的不归路 —— 线性空间光照
- 蓝牙 BLE GATT 剖析(一)
- android开发debug调试
- Eclipse非常实用的快捷键