349. Intersection of Two Arrays

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.

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        sort(nums1.begin(),nums1.end());
        sort(nums2.begin(),nums2.end());
        vector<int> temp;
        int flag;
        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 if(nums1[i]==nums2[j]){
                if(temp.size()==0||nums1[i]!=flag){
                    temp.push_back(nums1[i]);
                    flag=nums1[i];
                }
                i++;
                j++;
            }
        }
        return temp;
    }
};

else if(nums1[i]==nums2[j]){
                if(temp.size()==0||nums1[i]!=flag){
                    temp.push_back(nums1[i]);
                    flag=nums1[i];
                }
                i++;
                j++;
            }

不可以写做

else if(nums1[i]==nums2[j]){
                int k=temp.size()-1;
                if(temp[k]!=nums1[i]){
                    temp.push_back(nums1[i]);
                }
                i++;
                j++;
            }