C++ 8ms solution using sort


  • 0
    U
    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 i = 0, j = 0,cur = -1;
            while(i < nums1.size() && j < nums2.size())
            {
                if(nums1[i] < nums2[j])
                    ++i;
                else if(nums1[i] > nums2[j])
                    ++j;
                else
                {
                    if(cur == -1 || res[cur] != nums1[i])
                    {
                        res.push_back(nums1[i]);
                        ++cur;
                    }   
                    ++i,++j;
                }
            }
            return std::move(res);
        }
    };

Log in to reply
 

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