【leetcode】Intersection of Two Arrays II

原创 2016年06月01日 19:40:06

Question

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.

Code

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

class Solution {
public:
    vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
        if (nums1.empty())
            return nums1;
        else if (nums2.empty())
            return nums2;
        sort(nums1.begin(), nums1.end());
        sort(nums2.begin(), nums2.end());
        vector<int>res;
        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 {
                res.push_back(nums1[i]);
                i++;
                j++;
            }           
        }
        return res;
    }
};

int main() {
    Solution so;
    vector<int>nums1 = {1,2,2,1};
    vector<int>nums2 = {2,2};
    vector<int>res;
    res = so.intersect(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】350. Intersection of Two Arrays II

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

leetcode笔记--Intersection of Two Arrays I & II

Intersection of Two Arrays Given two arrays, write a function to compute their intersection. Example...

【leetcode76】Intersection of Two Arrays II

题目描述:给定两个数组求他们的公共部分,输出形式是数组,相同的元素累计计数例如:nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].原文描述:Given ...

Leetcode Intersection of Two Arrays i,ii查找两个数组的公共元素

主要为什么要选择用set,因为set容器不会出现相同的元素。 /********************************************************************...

[leetcode] 350. Intersection of Two Arrays II

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

[LeetCode] 350. Intersection of Two Arrays II

[LeetCode] 350. Intersection of Two Arrays II 解题思路

<LeetCode OJ> 349 / 350 Intersection of Two Arrays(I / II)

Total Accepted: 3212 Total Submissions: 6814 Difficulty: Easy Given two arrays, write a functio...

Leetcode——350. Intersection of Two Arrays II

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

Hold住Leetcode——Intersection of Two Arrays II

Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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