程式語言 - LeetCode - C++ - 162. Find Peak Element



參考資訊:
https://algo.monster/liteproblems/162
https://www.cnblogs.com/grandyang/p/4217175.html

題目:


解答:

class Solution {
public:
    int findPeakElement(vector<int>& nums) {
        nums.insert(nums.begin(), INT_MIN);
        nums.push_back(INT_MIN);

        for (int i = 1; i < nums.size() - 1; i++) {
            if ((nums[i] > nums[i - 1]) && (nums[i] > nums[i + 1])) {
                return i - 1;
            }
        }

        return 0;
    }
};