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.
Note:Your solution should be in logarithmic complexity.
class Solution {
public int findPeakElement(int[] nums) {
if(nums.length ==1 ){return 0;}
int i = 1;
while(i != nums.length-1){
if(nums[i-1] < nums[i] && nums[i] > nums[i+1]){
return i;
}
i++;
}
if(nums[i]>nums[i-1]){
return i;
}
return 0;
}
}
本站原创文章皆遵循“署名—非商业性使用—相同方式共享 4.0 协议 (CC BY-NC-SA 4.0)”。共享、演绎请保留以下标注：
原文作者：Jake Tao，来源：「162. Find Peak Element」
