题目链接:https://leetcode.com/problems/find-peak-element/
题目:
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.
click to show spoilers.
Note:
Your solution should be in logarithmic complexity.
解题思路:
二分查找的变形!!!
代码实现:
public class Solution {
public int findPeakElement(int[] nums) {
if(nums == null || nums.length == 0)
return 0;
int low = 0;
int high = nums.length - 1;
int mid = low;
while(low <= high) {
mid = (low + high) / 2;
boolean flagL = true;
boolean flagH = true;
if(mid - 1 >= 0) {
if(nums[mid - 1] > nums[mid])
flagL = false;
}
if(mid + 1 < nums.length) {
if(nums[mid + 1] > nums[mid])
flagH = false;
}
if(flagL && flagH)
break;
else if(flagL)
low = mid + 1;
else
high = mid - 1;
}
return mid;
}
}
58 / 58 test cases passed.
Status: Accepted
Runtime: 0 ms