LeetCode941

class Solution {

public:

    bool validMountainArray(vector<int>& arr) {

        if(arr.size()<3||arr[1]<=arr[0])

            return false;

        int index=1;

        for(int i=0;i<arr.size()-1;i++)

        {

            if(arr[i+1]==arr[i])

                return false;

            if(arr[i+1]<arr[i])

            {

                index=i;

                break;

            }

        }

        for(int j=index;j<arr.size()-1;j++)

        {

            if(arr[j+1]>=arr[j])

                return false;

        }

        return true;

    }

};