forked from jaege/Cpp-Primer-5th-Exercises
-
Notifications
You must be signed in to change notification settings - Fork 0
/
10.16.cpp
41 lines (36 loc) · 1.28 KB
/
10.16.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
#include <string>
#include <vector>
#include <algorithm>
#include <iostream>
std::string make_plural(size_t ctr, const std::string &word,
const std::string &ending = "s") {
return (ctr > 1) ? word + ending : word;
}
void elimDups(std::vector<std::string> &words) {
std::sort(words.begin(), words.end());
auto end_unique = std::unique(words.begin(), words.end());
words.erase(end_unique, words.end());
}
void biggies(std::vector<std::string> words, // use value instead of reference
std::vector<std::string>::size_type sz) {
elimDups(words);
std::stable_sort(words.begin(), words.end(),
[](const std::string &s1, const std::string &s2) {
return s1.size() < s2.size();
});
auto iter = std::find_if(words.begin(), words.end(),
[sz](const std::string &s) { return s.size() >= sz; });
auto count = words.end() - iter;
std::cout << count << " " << make_plural(count, "word") << " of length "
<< sz << " or longer." << std::endl;
std::for_each(iter, words.end(),
[](const std::string &s) { std::cout << s << " "; });
}
int main() {
std::vector<std::string> words;
for (std::string s; std::cin >> s; words.push_back(s)) {}
biggies(words, 3);
std::cout << std::endl;
biggies(words, 5);
return 0;
}