题目就是简单的查询最大值并返回下标嘛,但是要求有点头疼
第一次使用二分,不出意外的超时了
class Solution {
public:
int peakIndexInMountainArray(vector<int>& arr) {
auto length=arr.size();
auto middle=length/2;
auto left=0;
auto right=length-1;
int max;
while(arr[middle]<arr[middle+1]||arr[middle]<arr[middle-1]){
if(arr[middle]<arr[middle+1]){
middle=(middle+right)/2;
}
if(arr[middle]<arr[middle-1]){
middle=(middle+left)/2;
}
}
return middle;
}
};
自己写的二分和学到的不一样,但我感觉原理相同
再试试传统二分
class Solution {
public:
int peakIndexInMountainArray(vector<int>& arr) {
auto length=arr.size();
auto middle=length/2;
auto left=0;
auto right=length-1;
while(right!=left){
if(arr[middle]<arr[middle+1]){
left=middle;
middle = (middle+right)/2;
}
if(arr[middle]<arr[middle-1]){
right=middle;
middle = (middle+left)/2;
}
}
return middle;
}
};
寄,更超时
看题解了
class Solution {
public:
int peakIndexInMountainArray(vector<int>& arr) {
auto length=arr.size();
auto middle=length/2;
auto left=0;
auto right=length-1;
int max;
while(left<right){
if(arr[middle]<arr[middle+1]){
left=middle;
middle=(middle+right)/2;
}
else if(arr[middle]<arr[middle-1]){
right=middle;
middle=(middle+left)/2;
}
else return middle;
}
return middle;
}
};
根据题解改了下,while判断那里有点问题,为什么会超时啊