题解 | 寻找峰值

#include <climits>
class Solution {
public:
    /**
     * 寻找最后的山峰
     * @param a int整型一维数组 
     * @param aLen int a数组长度
     * @return int整型
     */
    int solve(int* a, int aLen) {
        // write code here
        int idx = -1;
        for (int i = 0; i < aLen; i++) {
            int left = i < 1 ? INT_MIN : a[i-1];
            int right = i > aLen - 2 ? INT_MIN : a[i+1];
            if (left <= a[i] && a[i] >= right) {
                idx = i;
            }
        }
        return idx;
    }
};