leetcode 744. Find Smallest Letter Greater Than Target

素颜马尾好姑娘i 2022-06-03 08:55 158阅读 0赞

Given a list of sorted characters letters containing only lowercase letters, and given a target letter target, find the smallest element in the list that is larger than the given target.

Letters also wrap around. For example, if the target is target = ‘z’ and letters = \[‘a’, ‘b’\], the answer is ‘a’.

Examples:  
Input:  
letters = \[“c”, “f”, “j”\]  
target = “a”  
Output: “c”

Input:  
letters = \[“c”, “f”, “j”\]  
target = “c”  
Output: “f”

Input:  
letters = \[“c”, “f”, “j”\]  
target = “d”  
Output: “f”

Input:  
letters = \[“c”, “f”, “j”\]  
target = “g”  
Output: “j”

Input:  
letters = \[“c”, “f”, “j”\]  
target = “j”  
Output: “c”

Input:  
letters = \[“c”, “f”, “j”\]  
target = “k”  
Output: “c”  
Note:  
letters has a length in range \[2, 10000\].  
letters consists of lowercase letters, and contains at least 2 unique letters.  
target is a lowercase letter.

本题题意很简单，只需要遍历即可

代码如下：

#include <iostream>
    #include <vector>
    #include <map>
    #include <set>
    #include <queue>
    #include <stack>
    #include <string>
    #include <climits>
    #include <algorithm>
    #include <sstream>
    #include <functional>
    #include <bitset>
    #include <numeric>
    #include <cmath>
    #include <regex>
    
    using namespace std;
    
    
    
    class Solution 
    {
    public:
        char nextGreatestLetter(vector<char>& letters, char target)
        {
            sort(letters.begin(), letters.end());
            for (char c : letters)
            {
                if (c > target)
                    return c;
            }
            return letters[0];
        }
    };