示例1：
输入：nums1 = [1,2,2,1], nums2 = [2,2] 输出：[2,2]
示例2：
输入：nums1 = [4,9,5], nums2 = [9,4,9,8,4]
输出：[4,9]
1.排序方法：
class Solution { public: vector<int> q; vector<int> intersect(vector<int>& nums1, vector<int>& nums2) { sort(nums1.begin(), nums1.end()); sort(nums2.begin(), nums2.end()); int length1 = nums1.size(); int length2 = nums2.size(); int s1 = 0, s2 = 0; while(s1 < length1 && s2 < length2) { if(nums1[s1] < nums2[s2]) { s1++; } else if(nums1[s1] > nums2[s2]) { s2++; } else { q.push_back(nums1[s1]); s1++; s2++; } } return q; } };
原文：https://www.cnblogs.com/captand/p/13295398.html