leetcode745: Find Smallest Letter Greater Than Target

最新推荐文章于 2022-07-14 11:26:51 发布

UESTC_kb216

最新推荐文章于 2022-07-14 11:26:51 发布

阅读量327

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/sinat_35425429/article/details/78964557

leetcode 专栏收录该内容

85 篇文章

订阅专栏

本文介绍了一个简单的算法问题解决方案：在一个已排序的字符列表中找到第一个大于指定目标字母的元素。如果目标字母位于列表末尾，则返回列表的第一个元素。文章通过示例展示了该算法的工作原理。

摘要生成于 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.

直接解就ok

	public char nextGreatestLetter(char[] letters, char target) {
		int j = 0;
		for (int i = 0; i < letters.length; i++) {
			if (letters[i] > target) {
				j = i;
				break;
			}
		}
		System.out.println(j);
		if (j == letters.length)
			return letters[0];
		else
			return letters[j];
	}