题目
A peak element is an element that is greater than its neighbors.
Given an input array where num[i] ≠ num[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 num[-1] = num[n] = -∞.
For example, in array [1, 2, 3, 1], 3 is a peak element and your function should return the index number 2.
分析
二分法
如果元素左边大,则左边一定存在peak,如果元素右边大,则右边一定存在peak
class Solution {
public static int findPeakElement(int[] nums) {
if (nums.length == 1) {
return 0;
}
int low = 0;
int high = nums.length-1;
if (nums[low]>nums[low+1]) {
return low;
} else if (nums[high]>nums[high-1]){
return high;
}
while (high-low >= 3) {
int mid = (high+low)/2;
if (nums[mid] > nums[mid-1] && nums[mid] > nums[mid+1]) {
return mid;
} else {
if (nums[mid]<nums[mid-1]) {
high = mid;
} else {
low = mid;
}
}
}
return (high+low)/2;
}
}