350. Intersection of Two Arrays II(简单题)

problem:

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

Example 1:

Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2,2]

Example 2:

Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [4,9]

Note:

Each element in the result should appear as many times as it shows in both arrays.
The result can be in any order.

tips:

返回两个vector中相同的字符，可以是无序的，所以可以先进行排序处理。

solution:

class Solution {
public:
    vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
        sort(nums1.begin(),nums1.end());
        sort(nums2.begin(),nums2.end());
        int m = nums1.size();
        int n = nums2.size();
        vector<int> nums;
        for(int i=0,j=0;i<m&&j<n;)
        {
            if(nums1[i] == nums2[j])
            {
                nums.push_back(nums1[i]);
                i++;
                j++;
            }
            else if(nums1[i] < nums2[j])
                i++;
            else if(nums1[i] > nums2[j])//这里条件如果省略的话，效率会降低
                j++;
        }
        return nums;
    }
};