Leetcode 162. Find Peak Element

最新推荐文章于 2024-03-04 19:33:34 发布

SnailTyan

最新推荐文章于 2024-03-04 19:33:34 发布

阅读量275

点赞数

分类专栏： Leetcode 文章标签： Leetcode

本文链接：https://blog.csdn.net/Quincuntial/article/details/81986227

版权

Leetcode 同时被 2 个专栏收录

409 篇文章 18 订阅

订阅专栏

Algorithm

260 篇文章 2 订阅

订阅专栏

文章作者：Tyan
博客：noahsnail.com | CSDN | 简书

1. Description

Find Peak Element

2. Solution

Version 1

class Solution {
public:
    int findPeakElement(vector<int>& nums) {
        if(nums.size() <= 1) {
            return 0;
        }
        if(nums[0] > nums[1]) {
            return 0;
        }
        if(nums[nums.size() - 1] > nums[nums.size() - 2]) {
            return nums.size() - 1;
        }
        for(int i = 1; i < nums.size() - 1; i++) {
            if(nums[i] > nums[i+1] && nums[i] > nums[i - 1]) {
                return i;
            }
        }
    }
};

Version 2

class Solution {
public:
    int findPeakElement(vector<int>& nums) {
        for(int i = 0; i < nums.size() - 1; i++) {
            if(nums[i] > nums[i+1]) {
                return i;
            }
        }
        return nums.size() - 1;
    }
};

Version 3

class Solution {
public:
    int findPeakElement(vector<int>& nums) {
        int left = 0;
        int right = nums.size() - 1;
        while(left < right) {
            int mid = (left + right) / 2;
            if(nums[mid] > nums[mid + 1]) {
                right = mid;
            }
            else {
                left = mid + 1;
            }
        }
        return left;
    }
};

Version 4

class Solution {
public:
    int findPeakElement(vector<int>& nums) {
        return binarySearch(nums, 0 , nums.size() - 1);
    }

private:
    int binarySearch(vector<int>& nums, int left, int right) {
        if(left == right) {
            return left;
        }
        int mid = (left + right) / 2;
        if(nums[mid] > nums[mid + 1]) {
            return binarySearch(nums, left, mid);
        }
        else {
            return binarySearch(nums, mid + 1, right);
        }
    }
};