LeetCode-744. Find Smallest Letter Greater Than Target

Description

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'.

Example

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

1.letters has a length in range [2, 10000].
2.letters consists of lowercase letters, and contains at least 2 unique letters.
3.target is a lowercase letter.

Solution 1(C++)

class Solution {
public:
    char nextGreatestLetter(vector<char>& letters, char target) {
        int mindif = 26;
        for(int i=0; i<letters.size(); i++){
            int temp = letters[i]-target;
            mindif = min(mindif, temp>0? temp : 26+temp);
        }
        return mindif>'z'-target? target-(26-mindif): target+mindif;
    }
};

Solution 2(C++)

class Solution {
public:
    char nextGreatestLetter(vector<char>& letters, char target) {
        if (letters.back() <= target) return letters.front();
        int low = 0, high = letters.size() - 1;
        while (low < high) {
            auto mid = (low + high) / 2;
            if (target < letters[mid]) high = mid;
            else low = mid + 1;
        }
        return letters[low];
    }
};

算法分析

算法比较简单，不赘述。

程序分析

程序比较简单，不赘述。