852. 山脉数组的峰顶索引

题目：[https://leetcode-cn.com/problems/peak-index-in-a-mountain-array/description/]
思路：描述很复杂，实质是找到最大值的位置

class Solution
{
public:
    int peakIndexInMountainArray(vector<int>& A)
    {
        int max{0};
        int loc;
        for(auto i=A.begin(); i!=A.end(); ++i)
        {
            if (*i>max)
            {
                loc=i-A.begin();
                max=*i;
            }
        }
        return loc;
    }
};

讨论区:[https://leetcode.com/problems/peak-index-in-a-mountain-array/discuss/139848/C++JavaPython-Better-than-Binary-Search]