1,题目要求
A peak element is an element that is greater than its neighbors.
Given an input array nums, where nums[i] ≠ nums[i+1], find a peak element and return its index.
The array may contain multiple peaks, in that case return the index to any one of the peaks is fine.
You may imagine that nums[-1] = nums[n] = -∞.
Example 1:
Input: nums = [1,2,3,1]
Output: 2
Explanation: 3 is a peak element and your function should return the index number 2.
Example 2:
Input: nums = [1,2,1,3,5,6,4]
Output: 1 or 5
Explanation: Your function can return either index number 1 where the peak element is 2,
or index number 5 where the peak element is 6.
峰值元素是大于其邻居的元素。
给定一个输入数组nums,其中nums [i]≠nums [i + 1],找到一个峰值元素并返回其索引。
该阵列可能包含多个峰值,在这种情况下,将索引返回到任何一个峰值都很好。
你可以想象nums [-1] = nums [n] =-∞。
2,题目思路
对于这道题,要求找到一个数组中的“峰值元素”。
所谓峰值元素,即该元素大于与其相邻的左侧的值和右侧的值。如果我们利用顺序查找的方法自然是可行的,即只要找到nums[i]<nums[i-1],则nums[i]就是我们找到的峰值。
但是,如果我们想要提高搜索的效率,还是常规的二分搜索的办法。
与常规的二分判断不太一样,在找到mid1时,我们还定义mid2 = mid1+1,然后判断二者的值的大小。
- 如果nums[mid1] < nums[mid2],说明此时的数组是递增的,peak一定在后面,因此让low = mid2。
- 否则,说明此时的数组是递减的,peak在前面,于是让high = mid1。
3,代码实现
int x = []() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
return 0;
}();
class Solution {
public:
int findPeakElement(vector<int>& nums) {
int low = 0;
int high = nums.size()-1;
while(low < high){
int mid1 = low + (high-low)/2;
int mid2 = mid1+1;
if(nums[mid1] < nums[mid2])
low = mid2;//此时是递增的,在右侧搜
else
high = mid1;//递减,在左侧搜
}
return low;
}
};