寻找比目标字母大的最小字符
给你一个排序后的字符列表 letters ,列表中只包含小写英文字母。
另给出一个目标字母 target,请你寻找在这一有序列表里比目标字母大的最小字母。
在比较时,字母是依序循环出现的。举个例子:
如果目标字母 target = 'z' 并且字符列表为 letters = ['a', 'b'],则答案返回 'a'
示例:
输入:
letters = ["c", "f", "j"]
target = "a"
输出: "c"
输入:
letters = ["c", "f", "j"]
target = "c"
输出: "f"
输入:
letters = ["c", "f", "j"]
target = "d"
输出: "f"
输入:
letters = ["c", "f", "j"]
target = "g"
输出: "j"
输入:
letters = ["c", "f", "j"]
target = "j"
输出: "c"
输入:
letters = ["c", "f", "j"]
target = "k"
输出: "c"
提示:
letters长度范围在[2, 10000]区间内。
letters 仅由小写字母组成,最少包含两个不同的字母。
目标字母target 是一个小写字母。
题解
class Solution:
def nextGreatestLetter(self, letters: List[str], target: str) -> str:
length = len(letters)
first = 0
last = length - 1
while last >= first:
mid = first + (last-first)//2
if letters[mid] == target:
while mid+1 < length and letters[mid+1] == letters[mid]:
mid += 1
return letters[mid+1] if mid+1 < length else letters[0]
elif letters[mid] > target:
last = mid - 1
else:
first = mid + 1
return letters[0] if first > (length-1) else letters[first]