leetcode-852. 山脉数组的峰顶索引-C语言

/*
 * 算法思想： 二分法
 */

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;
}