-
Notifications
You must be signed in to change notification settings - Fork 0
/
array2.cpp
55 lines (38 loc) · 990 Bytes
/
array2.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include <iostream>
#include <vector>
std::vector<int> intersect(std::vector<int> & nums1, std::vector<int> & nums2)
{
int x;
std::vector <int> result;
for(int i = 0; i < nums1.size();++i)
{
for(int j = 0; nums2.size(); ++j)
{
if(nums2[j] == nums1[i])
{
nums1[i] = x;
printf("%d", x);
result.push_back(x);
}
}
}
return result;
}
int main()
{
std::vector <int> v1;
std::vector <int> v2;
std::vector <int> solution;
v1.push_back(1);
v1.push_back(1);
v1.push_back(2);
v1.push_back(2);
v1.push_back(5);
v2.push_back(1);
v2.push_back(0);
v2.push_back(0);
v2.push_back(2);
v2.push_back(5);
solution = intersect(v1, v2);
return 0;
}