[leetcode] 744. Find Smallest Letter Greater Than Target

[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’.

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.

分析

题目的意思是：给出一个字符数组，和一个字符，要求在字符数组中找出比该字符稍稍大一点的字符。

题目比较简单，二分搜索。

代码

class Solution {public: char nextGreatestLetter(vector& letters, char target) { if (target >= letters.back()) return letters[0]; int i=0; int j=letters.size()-1; int n=letters.size(); while(i

参考文献

​​LeetCode Binary Search Summary 二分搜索法小结​​​​[LeetCode] Find Smallest Letter Greater Than Target 找比目标值大的最小字母​​

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。