题目描述:给定一个有序的字符数组 letters 和一个字符 target,要求找出 letters 中大于 target 的最小字符,如果找不到就返回第 1 个字符
Input:
letters = ["c", "f", "j"]
target = "d"
Output: "f"
Input:
letters = ["c", "f", "j"]
target = "k"
Output: "c"
思路:这道题做的时候太急,没好好看看题目的例子,导致我做完只能通过2/3的测试用例,
这个题目用二分比较合适,因为复杂度为O(log n),
public char nextGreatestLetter(char[] letters, char target) {
int left=0,right=letters.length-1;
while(left<=right){
int mid=left+(right-left)/2;
if(target<letters[mid]){
right=mid-1;
}else{
left=mid+1;
}
}
return left<letters.length ?letters[left] :letters[0];
}