public class Solution {
public int findPeakElement(int[] nums) {
int len = nums.length;
if(0 == len) return -1;
else if(1 == len) return 0;
else {
if(nums[0] > nums[1]) return 0;
if(nums[len - 1] > nums[len - 2]) return len - 1;
int front, middle, rear;
for(int i = 0; i < len - 2; ++i) {
rear = nums[i];
middle = nums[i + 1];
front = nums[i + 2];
if(rear < middle && middle > front) return i + 1;
}
return -1;
}
}
}
Find Peak Element
最新推荐文章于 2021-09-27 22:55:19 发布