/*
* 算法思想: 二分法
*/
int peakIndexInMountainArray(int* A, int ASize){
int i=0, j=ASize-1;
int mid;
while(i<=j){
mid = i+(j-i) / 2;
if(j == i)
return mid;
else if(A[mid] < A[mid+1]){
i = mid+1;
}else {
j = mid;
}
}
return 66;
}
leetcode-852. 山脉数组的峰顶索引-C语言
猜你喜欢
转载自blog.csdn.net/weixin_36094222/article/details/93644398
今日推荐
周排行