744 Find Smallest Letter Greater Than Target

最新推荐文章于 2019-11-25 16:23:08 发布

hareyukai

最新推荐文章于 2019-11-25 16:23:08 发布

阅读量149

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode Java

本文链接：https://blog.youkuaiyun.com/guothin/article/details/80004963

LeetCode 同时被 2 个专栏收录

13 篇文章

订阅专栏

Java

12 篇文章

订阅专栏

本文介绍了一个算法问题：在一个已排序的小写字母列表中找到第一个大于指定目标字母的元素。若目标字母大于列表中所有字母，则返回列表的第一个元素。文章通过示例展示了该算法的工作原理。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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(char[] letters, char target) {
    if (letters.length < 1) { return target; }
    if (letters[letters.length - 1] < target) { return letters[0]; }
    for (int i = 0; i < letters.length; i++) {
      if (target < letters[i]) {
        return letters[i];
      }
    }
    return letters[0];
  }
}