leetcode 349
Given two arrays, write a function to compute their intersection.
Example:
Given nums1 = [1, 2, 2, 1]
, nums2 = [2, 2]
, return [2]
.
Note:
- Each element in the result must be unique.
- The result can be in any order.
class Solution {
public:
vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
vector<int> res;
for(int i=0;i<nums1.size();i++)
{
//当nums1中某一元素在nums2中没有找到且在结果res中还没有出现过,则保存进res
if(isFind(nums2,nums1[i])==true&&isFind(res,nums1[i])==false)
res.push_back(nums1[i]);
}
return res;
}
bool isFind(const vector<int> nums, int e)//查看元素e是否在数组nums中出现
{
for(int i=0;i<nums.size();i++)
{
if(e==nums[i])
return true;
}
return false;
}
};