<p>Given two integer arrays <code>nums1</code> and <code>nums2</code>, return <em>an array of their <span data-keyword="array-intersection">intersection</span></em>. Each element in the result must be <strong>unique</strong> and you may return the result in <strong>any order</strong>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums1 = [1,2,2,1], nums2 = [2,2]
<strong>Output:</strong> [2]
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums1 = [4,9,5], nums2 = [9,4,9,8,4]
<strong>Output:</strong> [9,4]
<strong>Explanation:</strong> [4,9] is also accepted.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums1.length, nums2.length &lt;= 1000</code></li>
	<li><code>0 &lt;= nums1[i], nums2[i] &lt;= 1000</code></li>
</ul>

class Solution {
public:
    vector<int> intersection(vector<int>& arr1, vector<int>& arr2) {
    int n=arr1.size();
    int m=arr2.size();
    int i=0,j=0;
	vector<int>ans;
    sort(arr1.begin(),arr1.end());
    sort(arr2.begin(),arr2.end());
	while(i<n && j<m){
		if(arr1[i]==arr2[j]){
            int size=ans.size();
            if(size==0){
			ans.push_back(arr1[i]);
            }
            else if(ans[size-1]!=arr1[i]){
                ans.push_back(arr1[i]);
            }
			i++;
			j++;
		}
		else if(arr1[i]<arr2[j]){
			i++;
		}
		else{
			j++;
		}
	}
	return ans;
    }
};
12700