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

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