Today I have done leetcode's March LeetCoding Challenge with cpp.

March LeetCoding Challenge 10

Description

Intersection of Two Arrays

Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any order.

Example 1:

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

Example 2:

Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [9,4]
Explanation: [4,9] is also accepted.

Constraints:

• 1 <= nums1.length, nums2.length <= 1000
• 0 <= nums1[i], nums2[i] <= 1000

Solution

class Solution {
public:
  vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
    vector<int> answer(max(nums1.size(), nums2.size()));
    sort(nums1.begin(), nums1.end());
    sort(nums2.begin(), nums2.end());
    auto it = set_intersection(nums1.begin(), nums1.end(), nums2.begin(), nums2.end(), answer.begin());
    answer.resize(it - answer.begin());
    answer.resize(unique(answer.begin(), answer.end()) - answer.begin());
    return answer;
  }
};