leetcode941

public class Solution
    {
        public bool ValidMountainArray(int[] A)
        {
            bool findTop = false;
            if (A.Length < 3)
            {
                return false;
            }
            int baseNum = A[0];
            for (int i = 1; i < A.Length; i++)
            {
                if (!findTop)
                {
                    if (baseNum < A[i])
                    {

                    }
                    else if (baseNum == A[i])
                    {
                        return false;
                    }
                    else
                    {
                        if (i > 1)
                        {
                            findTop = true;
                        }
                        else
                        {
                            return false;
                        }
                    }
                }
                else
                {
                    if (baseNum > A[i])
                    {

                    }
                    else
                    {
                        return false;
                    }
                }
                baseNum = A[i];
            }
            return findTop;
        }
    }

猜你喜欢

转载自www.cnblogs.com/asenyang/p/9978789.html