【leetcode】Intersection of Two Arrays II

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