-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsparseArrays.cpp
More file actions
71 lines (50 loc) · 1.49 KB
/
sparseArrays.cpp
File metadata and controls
71 lines (50 loc) · 1.49 KB
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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include <bits/stdc++.h>
using namespace std;
// Complete the matchingStrings function below.
vector<int> matchingStrings(vector<string> strings, vector<string> queries) {
vector<int> retArray(queries.size()); // if do not init the size of the array, will get a seg fault later when assigning
int match, i;
while (i < queries.size()) {
for (int j = 0; j < strings.size(); j++) {
if (queries[i] == strings[j]) {
match++;
}
}
retArray[i] = match;
match = 0;
i++;
}
return retArray;
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
int strings_count;
cin >> strings_count;
cin.ignore(numeric_limits<streamsize>::max(), '\n');
vector<string> strings(strings_count);
for (int i = 0; i < strings_count; i++) {
string strings_item;
getline(cin, strings_item);
strings[i] = strings_item;
}
int queries_count;
cin >> queries_count;
cin.ignore(numeric_limits<streamsize>::max(), '\n');
vector<string> queries(queries_count);
for (int i = 0; i < queries_count; i++) {
string queries_item;
getline(cin, queries_item);
queries[i] = queries_item;
}
vector<int> res = matchingStrings(strings, queries);
for (int i = 0; i < res.size(); i++) {
fout << res[i];
if (i != res.size() - 1) {
fout << "\n";
}
}
fout << "\n";
fout.close();
return 0;
}