leetcode-941. 有效的山脉数组-C语言

bool validMountainArray(int* arr, int ASize){
    int i, flag = 0, flag2 = 0;
    int max = INT_MIN;
    int max_index=-1;
    
    for(i=0; i<ASize; i++){
        if(arr[i] > max){
            max = arr[i];
            max_index = i;
        }
    }
    //printf("max = %d, max_index = %d \n", max, max_index);
    for(i=0; i<ASize-1; i++){
        if(i<max_index){
            flag = 1;
            if(arr[i] >= arr[i+1]) {
                //printf("1===%d, %d, \n", arr[i], arr[i+1]);
                return false;
            }
                
        }else{
            flag2 = 1;
            if(arr[i] <= arr[i+1]) {
               // printf("2===%d, %d, \n", arr[i], arr[i+1]);
                return false;
            } 
                
        }
    }
    
    
    return flag && flag2;
}