给你一个排序后的字符列表 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"
解题思路:采用二分查找的方法,每次折半寻找,如果中间值大于目标值,end = mid-1,如果小于等于目标值,start=mid+1;直到start>end,最后如果start指针大于数组的长度,那么应该返回第一个元素,如果没有那就返回start所指的元素。
class Solution {
public char nextGreatestLetter(char[] letters, char target) {
int length = letters.length;
int start = 0,end = length-1;
while(start<=end){
int mid = (start+end)/2;
if(letters[mid]<=target){
start = mid+1;
}else{
end = mid-1;
}
}
return start<length ? letters[start] : letters[0];
}
}