【leetcode】有效的山脉数组

 

bool validMountainArray(int* A, int ASize){
    if (ASize<3)return false;
    int index = ASize;
    for (int i = 0; i < ASize-1; i++)
    {
        if (i == 0 && A[i]>=A[i + 1])
            return false;
        else if (A[i] == A[i+1])
            return false;
        else if (index == ASize && A[i] > A[i + 1])
        {
            index = i;
            continue;
        }
        else if (i > index && A[i] < A[i + 1])
            return false;
    }
    return index != ASize;
}