问题原文地址点击打开链接
代码如下
public int findPeakElement(int[] nums) {
if (nums.length == 0 || nums == null) return 0 ;
if (nums.length == 1) return 0;
int[] left = new int[nums.length];//记录当前元素值是否大于左边的数,是的话就是1,不是就是默认值0
left[0] = 1;//题目默认nums[-1]为负无穷
int[] right = new int[nums.length];//同理上述。只不过方向相反
right[nums.length-1] = 1;
for (int i = 1;i<nums.length;i++){
if (nums[i]>nums[i-1]) left[i] = 1;
if (nums[nums.length-1-i]>nums[nums.length-i]) right[nums.length-1-i] = 1;
}
int res = 0;
for (int i = 0;i<nums.length;i++){
if (left[i] > 0 && right[i]>0){
res = i;
break;
}
}
return res;
}