标签：find peak element binary search
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.
Your solution should be in logarithmic complexity.
Credits:
Special thanks to @ts for adding this problem and creating all test cases.
public int findPeakElement(int[] num) {
int left=0,right=num.length-1;
int mid=0;
int num1=0,num2=0;
while(left<=right){
if(left==right)
return left;
mid=(left+right)/2;
if(num[mid]<num[mid+1])
left=mid+1;
else
right=mid;
}
return 0;
}标签：find peak element binary search
原文地址：http://blog.csdn.net/mnmlist/article/details/45739945
