[leetcode]350. Intersection of Two Arrays II

Given two arrays, write a function to compute their intersection.

Example 1:

Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [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.

分析：

返回两个数组的交集，结果中相同元素要与原数组中出现次数一致，不考虑顺序。同样是先对两个数组排序，用两个指针i、j遍历两个数组，只要元素相同，就将元素放入结果数组中；否则，元素值小的指针右移一位，直到其中一个数组遍历完即可。

class Solution {
public:
    vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
        vector <int> nums;
        int i = 0;
        int j = 0;
        sort(nums1.begin() , nums1.end());
        sort(nums2.begin() , nums2.end());
        while(i<nums1.size() && j<nums2.size())
        {
            if(nums1[i] == nums2[j])
            {
                nums.push_back(nums1[i]);
                i++;
                j++;
            }
            else if(nums1[i] > nums2[j])
                j++;
            else
                i++;
        }
      
    return nums;

    }
};