-
Notifications
You must be signed in to change notification settings - Fork 0
/
Sparse Arrays.cpp
107 lines (79 loc) · 2.49 KB
/
Sparse Arrays.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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
/*
* Complete the 'matchingStrings' function below.
*
* The function is expected to return an INTEGER_ARRAY.
* The function accepts following parameters:
* 1. STRING_ARRAY stringList
* 2. STRING_ARRAY queries
*/
vector<int> matchingStrings(vector<string> stringList, vector<string> queries) {
// intailze a vector to store the result
vector<int> result;
// loop in range over the strings on queries
for (auto &query: queries){
// intialize a counter to count the number of times the query string appears in the string list
int counter = 0;
// loop over the strings in the string list
for(auto &str : stringList){
// if the query string is equal to the string in the string list
if (query == str){
// increment the counter
counter++;
}
}
result.push_back(counter);
}
return result;
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
string stringList_count_temp;
getline(cin, stringList_count_temp);
int stringList_count = stoi(ltrim(rtrim(stringList_count_temp)));
vector<string> stringList(stringList_count);
for (int i = 0; i < stringList_count; i++) {
string stringList_item;
getline(cin, stringList_item);
stringList[i] = stringList_item;
}
string queries_count_temp;
getline(cin, queries_count_temp);
int queries_count = stoi(ltrim(rtrim(queries_count_temp)));
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(stringList, queries);
for (size_t i = 0; i < res.size(); i++) {
fout << res[i];
if (i != res.size() - 1) {
fout << "\n";
}
}
fout << "\n";
fout.close();
return 0;
}
string ltrim(const string &str) {
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);
return s;
}
string rtrim(const string &str) {
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end()
);
return s;
}