寻找比目标字母大的最小字母
给定一个只包含小写字母的有序数组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"
思路+代码+注释:
/*
思路:使用二分查找,如果mid大于target,接下来判断mid是否为第一个大于target的数,如果mid==0或者mid-1小于等于target那么mid就是第一个
大于target的数返回mid,否则mid就不是第一个大于target的数该数在前面所以high=mid-1;如果mid小于target那么大于target的数在后面,那么
low=mid+1
*/
int low=0;
int high=letters.length-1;
while (low<=high)
{
int mid=(low+high)/2;
if (letters[mid]>target)
{
if (mid==0 || letters[mid-1]<=target)
{
return letters[mid];
}else {
high=mid-1;
}
}else {
low=mid+1;
}
}
return letters[0];