Simple C++ solution by sort


  • 1
    C

    Simple C++ solution by sort

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

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.