forked from kilian-hu/hackerrank-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstub.cc
92 lines (62 loc) · 1.74 KB
/
stub.cc
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
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
/*
* Complete the 'stringAnagram' function below.
*
* The function is expected to return an INTEGER_ARRAY.
* The function accepts following parameters:
* 1. STRING_ARRAY dictionary
* 2. STRING_ARRAY query
*/
vector<int> stringAnagram(vector<string> dictionary, vector<string> query) {
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
string dictionary_count_temp;
getline(cin, dictionary_count_temp);
int dictionary_count = stoi(ltrim(rtrim(dictionary_count_temp)));
vector<string> dictionary(dictionary_count);
for (int i = 0; i < dictionary_count; i++) {
string dictionary_item;
getline(cin, dictionary_item);
dictionary[i] = dictionary_item;
}
string query_count_temp;
getline(cin, query_count_temp);
int query_count = stoi(ltrim(rtrim(query_count_temp)));
vector<string> query(query_count);
for (int i = 0; i < query_count; i++) {
string query_item;
getline(cin, query_item);
query[i] = query_item;
}
vector<int> result = stringAnagram(dictionary, query);
for (int i = 0; i < result.size(); i++) {
fout << result[i];
if (i != result.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;
}