A peak element is an element that is greater than its neighbors.
Given an input array where numi ≠ numi 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 = numn = -∞.
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.
Credits:
Special thanks to @ts for adding this problem and creating all test cases.
代码语言：txt复制 public int findPeakElement(int[] nums) {
int low = 0;
int high = nums.length - 1;
while (low < high) {
int mid = low (high - low) / 2;
if (nums[mid] > nums[mid 1]) {
high = mid;
} else {
low = mid 1;
}
}
return low;
}
