LeetCode/cpp/find-smallest-letter-greater-than-target.cpp
Matej Focko 2351dfd0ee
chore: unwrap one layer
Signed-off-by: Matej Focko <mfocko@redhat.com>
2023-12-12 14:36:00 +01:00

23 lines
604 B
C++

#include <algorithm>
#include <cassert>
#include <vector>
class Solution {
public:
char nextGreatestLetter(const std::vector<char>& letters, char target)
{
auto it = std::lower_bound(letters.begin(), letters.end(), target + 1);
return it == letters.end() ? letters.front() : *it;
}
};
int main()
{
Solution s;
assert((s.nextGreatestLetter(std::vector { 'c', 'f', 'j' }, 'a') == 'c'));
assert((s.nextGreatestLetter(std::vector { 'c', 'f', 'j' }, 'c') == 'f'));
assert((s.nextGreatestLetter(std::vector { 'x', 'x', 'y', 'y' }, 'z') == 'x'));
return 0;
}