题解 | #寻找牛群中的最高牛#

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param heights int整型vector 
     * @return int整型
     */
    int findPeakElement(vector<int>& heights) {
        // write code here
        int maxi = 0, maxheight = 0;
        for (int i = 0; i < heights.size(); ++i)
        {
            if (maxheight <= heights[i])
            {
                maxheight = heights[i];
                maxi = i;
            }
        }
        return maxi;
    }
};