寻找峰值-数组162-python&c++

python

线性遍历

import sys

class Solution:
    def findPeakElement(self, nums: List[int]):
        n = len(nums)
        nums.append(-sys.maxsize)
        for i in range(n):
            if nums[i] > nums[i-1] and nums[i] > nums[i+1]:
                return i
        
        return 0

二分查找

import sys

class Solution:
    def findPeakElement(self, nums: List[int]):
        l, r = 0, len(nums)-1
        
        while l != r:
            mid = (l+r) // 2
            if nums[mid] < nums[mid+1]:
                l = mid + 1
            else:
                r = mid
        
        return l

c++

class Solution {
public:
    int findPeakElement(vector<int>& nums) {
        // 二分查找+贪心思想
        // 当一个数不是峰值时，那么存在3种情况：左大右小，左大右大，左小右大
        // 分别判断情况，搜索区间优先想更大值的方向收缩，因为这个更大值更有可能成为峰值
        // 需要在数组的开头位置和最后位置插入INT_MIN，防止边界情况
        // 但该算法不好处理2个元素的情况，需要额外判断，比如[-2147483648,-2147483647]或[-2147483647,-2147483648]
        if (nums.size() == 2) {
            return nums[0] > nums[1] ? 0 : 1;
        }

        int left = 1, right = nums.size();
        nums.push_back(INT_MIN);
        nums.insert(nums.begin(), INT_MIN);

        while (left <= right) {
            int mid = left + (right - left) / 2;
            
            if (nums[mid-1] < nums[mid] && nums[mid] < nums[mid+1]) {
                left = mid + 1;
            } else if (nums[mid-1] > nums[mid] && nums[mid] < nums[mid+1]) {
                if (nums[mid-1] >= nums[mid+1]) {
                    right = mid - 1;
                } else {
                    left = mid + 1;
                }
            } else if (nums[mid-1] > nums[mid] && nums[mid] > nums[mid+1]) {
                right = mid - 1;
            } else {
                return mid-1;
            }
        }

        return -1;
    }
};

class Solution {
public:
    int findPeakElement(vector<int>& nums) {
        // 二分查找+贪心思想
        // 当mid值小于mid+1值，则mid+1值更有可能是峰值，更新左边界
        // 否则mid更有可能是峰值，更新右边界，但不要越过mid，而是等于mid，毕竟mid还要被考虑
        // 循环跳出是left==right
        int left = 0, right = nums.size()-1;

        while (left != right) {
            int mid = left + (right - left) / 2;

            if (nums[mid] < nums[mid+1]) {
                left = mid + 1;
            } else {
                right = mid;
            }
        }

        return left;
    }
};