Intersection of Two Arrays

Intersection of Two Arrays

• Total Accepted: 39169
• Total Submissions: 87928
• Difficulty: Easy

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.

分析：对nums1,nums2排序，以nums1位序，和nums2比较，根据大小分类讨论。

代码：

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        sort(nums1.begin(),nums1.end());
        sort(nums2.begin(),nums2.end());
        vector<int>res;
        int cur=0;
        int resnum=0;
        for(int i=0; i<nums1.size(); i++)
        {
            if(cur>=nums2.size())
            {
                break;
            }
            if(resnum!=0&&nums1[i]==res[resnum-1])
            continue;
            if(nums1[i]==nums2[cur])
            {
                res.push_back(nums1[i]);
                resnum++;
                cur++;
                continue;
            }
            else if(nums1[i]<nums2[cur])
            {
                continue;
            }
            else
            {
                
                while(nums1[i]>nums2[cur]&&cur<nums2.size())
                {
                    cur++;
                }
                if(cur<nums2.size())
                {
                    if(nums1[i]==nums2[cur])
                    {
                        res.push_back(nums1[i]);
                        resnum++;
                        cur++;
                        continue;
                    }
                    
                }
            }
        }
        return res;
    }
};