【leetcode】Intersection of Two Arrays

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;
}