LeetCode刷题 | 744. Find Smallest Letter Greater Than Target | 简单 循环题

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

Lettersalso 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:

1.      letters has a length in range [2, 10000].

2.      letters consists of lowercase letters, and contains at least 2 uniqueletters.

3.      target is a lowercase letter.

水题，直接遍历一遍数组就能得到想要的结果。

这题让我学会了遍历vector的一个更简单的方法，就是

For(auto each:letters)

{

Alpha[each]=1;

}

class Solution {

public:

    charnextGreatestLetter(vector<char>& letters, char target) {

       

        int i=0;

        for(i=0;i<letters.size();i++)

        {

            if(letters[i]>target) returnletters[i];

        }

        if(i==letters.size()) returnletters[0];

    }

};