【leetcode】Intersection of Two Arrays

原创 2016年05月31日 15:53:09

Question

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.

Code

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        if (nums1.empty())//判断是否为空集,若为空集,那么交集也为空集
            return nums1;
        else if (nums2.empty())
            return nums2;
        vector<int> res;//存放结果的容器
        sort(nums1.begin(), nums1.end());//对元素进行升序排列
        sort(nums2.begin(), nums2.end());
        for (int i = 0, j = 0; i < nums1.size() && j < nums2.size();) {
            if (nums1[i] < nums2[j])
                i++;
            else if (nums1[i] > nums2[j])
                j++;
            else {//两个元素相等
                i++;
                j++;
                if (!res.empty()) {//res不为空
                    if (res[res.size() - 1] == nums1[i - 1])//已经存在此数字
                        continue;
                    else
                        res.push_back(nums1[i - 1]);//不存在此数字
                }
                else//res为空
                    res.push_back(nums1[i - 1]);
            }
        }
        return res;
    }
};

int main() {
    Solution so;
    vector<int> nums1 = { 1,2,2,1 };
    vector<int> nums2 = { 2,2 };
    vector<int>res;
    res=so.intersection(nums1, nums2);
    for (vector<int>::iterator it = res.begin(); it != res.end(); it++) 
    {
        cout << *it << " ";
    }
    cout << endl;
    system("pause");
    return  0;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。

leetcode350~Intersection of Two Arrays II

Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, 2...

LeetCode 349. Intersection of Two Arrays

题目: Given two arrays, write a function to compute their intersection.Example: Given nums1 = [1, 2,...

leetcode解题之349 & 350. Intersection of Two Arrays Java版(求数组交集))

350. Intersection of Two Arrays II leetcode解题之349. Intersection of Two Arrays & 350. Intersection ...

leetcode349~Intersection of Two Arrays

Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, 2...

【Leetcode】349. Intersection of Two Arrays

方法一: 思路: 为避免重复,用Set存储后再存入结果数组。 遍历nums1,对nums2的每一个元素,若找到与nums1对应元素相等的元素且在Set中未出现,则加入Set。 public clas...

leetcode:Intersection of Two Arrays

349. Intersection of Two Arrays  My Submissions Question Editorial Solution Total Accepted: 16575...

Hold住Leetcode——Intersection of Two Arrays

Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, 2, 1...

[LeetCode] Intersection of Two Arrays II 两个数组的交集II

声明:原题目转载自LeetCode,解答部分为原创 Problem : Given two arrays, write a function to compute their ...
  • xblog_
  • xblog_
  • 2017年03月26日 15:23
  • 154

【Leetcode】350. Intersection of Two Arrays II

方法一: 思路: 用flag标记是否nums2中的该元素已经是相交的元素,若不是才加入结果list,并置flag为1然后跳出内层循环继续判断nums1的下一个元素。 public class Solu...

350.[LeetCode]Intersection of Two Arrays

算法效率分析如下:// m n // 如果我用二分排序,那么时间就是 (nlogn + mlogm + m + n) // 但是用java的哈希表的话,时间可以缩短到 O(m+n),因为哈希表的插入时...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:【leetcode】Intersection of Two Arrays
举报原因:
原因补充:

(最多只允许输入30个字)