Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit e1b6bcc

Browse files
committed
Prob: 180 intersection of arrays
1 parent c942fb6 commit e1b6bcc

File tree

2 files changed

+50
-1
lines changed

2 files changed

+50
-1
lines changed

‎README.md‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66

77
| Current Status| Stats |
88
| :------------: | :----------: |
9-
| Total Problems | 179 |
9+
| Total Problems | 180 |
1010

1111
</center>
1212

@@ -256,3 +256,4 @@ Include contains single header implementation of data structures and some algori
256256
| Find median from a data stream. Design a data structure that supports addNum to add a number to the stream, and findMedian to return the median of the current numbers seen so far. Also, if the count of numbers is even, return average of two middle elements, return median otherwise.|[median_stream.cpp](leet_code_problems/median_stream.cpp)
257257
| Remove the minimum number of invalid parentheses in order to make the input string valid. Return all possible results. Note: The input string may contain letters other than the parentheses ( and ) | [remove_invalid_parenthesis.cpp](leet_code_problems/remove_invalid_parenthesis.cpp)|
258258
| Given an array and a value, remove all instances of that value in-place and return the new length. Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory. The order of elements can be changed. It doesn't matter what you leave beyond the new length.| [remove_element.cpp](leet_code_problems/remove_element.cpp)|
259+
| Find intersection of two arrays/vectors, Given two vectors find the result of their interaction. The result should only contain unique characters and can be in any order|[intersection_of_array.cpp](leet_code_problems/intersection_of_array.cpp)|
Lines changed: 48 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,48 @@
1+
/*
2+
* Find intersection of two arrays/vectors:
3+
* Given two vectors find the result of their interaction.
4+
* The result should only contain unique characters and can be in any order.
5+
*
6+
* [1 2 3 3 4 4 5 5]
7+
* [2 3 5 5 4 4 6]
8+
* Result: [2 3 5 4] or [2 3 4 5]
9+
*/
10+
11+
#include <iostream>
12+
#include <vector>
13+
#include <unordered_set>
14+
15+
std::vector<int> find_intersection(const std::vector<int>& vec1,
16+
const std::vector<int>& vec2)
17+
{
18+
std::vector<int> result;
19+
std::unordered_set<int> set(vec1.begin(), vec1.end());
20+
for (int num : vec2) {
21+
if (set.erase(num)) {
22+
result.push_back(num);
23+
}
24+
}
25+
return result;
26+
}
27+
28+
template <typename T>
29+
void print_vector(const std::vector<T>& vec) {
30+
for (auto n: vec) {
31+
std::cout << n << " ";
32+
}
33+
std::cout << std::endl;
34+
}
35+
36+
int main()
37+
{
38+
std::vector<int> vec1 {1, 2, 3, 3, 4, 4, 5, 5};
39+
std::vector<int> vec2 {2, 3, 5, 5, 4, 4, 6};
40+
std::cout << "Vec 1: ";
41+
print_vector(vec1);
42+
std::cout << "Vec 2: ";
43+
print_vector(vec2);
44+
std::vector<int> result = find_intersection(vec1, vec2);
45+
std::cout << "Result: ";
46+
print_vector(result);
47+
return 0;
48+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /