Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
- sort(nums2.begin(),nums2.end());
- vector<int>r;
- for(auto u : nums1)
- {
- if(binary_search(nums2.begin(),nums2.end(),u))
- r.push_back(u);
- }
- sort(r.begin(),r.end());
- int s=unique(r.begin(),r.end())-r.begin();
- while(r.size()>s) r.pop_back();
- return r;
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement