852. 山脉数组的峰顶索引
思路
考察峰值,将mid位置的值和两边的值进行比较,
完整代码
public int peakIndexInMountainArray(int[] arr) {
int n = arr.length;
int left = 0;
int right = n - 1;
if(arr[0] > arr[1]){
return 0;
}
if(arr[n - 1] > arr[ n - 2]){
return n - 1;
}
while(left < right){
int mid = (left + right) / 2;
if(arr[mid - 1] < arr[mid] && arr[mid] > arr[mid + 1]){
return mid;
}else if(arr[mid - 1] < arr[mid] && arr[mid] < arr[mid + 1]){//上升
left = mid;
}else{
right = mid;
}
}
return left;
}
374. 猜数字大小
思路
这个题目有点难以理解:
我们要找出题目给的picknumber。每次猜的数字和pick的相对大小通过调用guess()得到。
如果猜的数字比pick小,guess()返回1,比pick大,返回-1,相等返回pick
完整代码
public int guessNumber(int n) {
int left = 1;
int right = n;
while(left < right){
int mid = left + (right - left) / 2;
if(guess(mid) == 1){
left = mid + 1;
}else if(guess(mid) == -1){
right = mid - 1;
}else{
return mid;
}
}
return left;
}