Поиск в отсортированном векторе, словаре и множестве 2/3

RobertDeMilo

Nov 13th, 2023

105

Never

Add comment

Not a member of Pastebin yet? Sign Up, it unlocks many cool features!

C++ 1.26 KB | None | 0 0

raw download clone embed print report

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
template <typename RandomIt>
pair<RandomIt, RandomIt> FindStartsWith(RandomIt range_begin, RandomIt range_end, char prefix)
{
auto it1 = lower_bound(range_begin, range_end, string(1, prefix));
/*auto it2 = upper_bound(range_begin, range_end, string(1, prefix));*/
auto it2 = upper_bound(range_begin, range_end, prefix,
[prefix](char str2, const string& str1) {return str1[0] > str2; });
return { it1,it2 };
}
int main() {
const vector<string> sorted_strings = { "moscow", "murmansk", "vologda" };
const auto m_result = FindStartsWith(begin(sorted_strings), end(sorted_strings), 'm');
for (auto it = m_result.first; it != m_result.second; ++it) {
cout << *it << " ";
}
cout << endl;
const auto p_result = FindStartsWith(begin(sorted_strings), end(sorted_strings), 'p');
cout << (p_result.first - begin(sorted_strings)) << " " << (p_result.second - begin(sorted_strings)) << endl;
const auto z_result = FindStartsWith(begin(sorted_strings), end(sorted_strings), 'z');
cout << (z_result.first - begin(sorted_strings)) << " " << (z_result.second - begin(sorted_strings)) << endl;
return 0;
}

Add Comment

Please, Sign In to add comment