zoukankan      html  css  js  c++  java
  • LeetCode 162 Find Peak Element

    Problem:

    A peak element is an element that is greater than its neighbors.

    Given an input array where num[i] ≠ num[i+1], find a peak element and return its index.

    The array may contain multiple peaks, in that case return the index to any one of the peaks is fine.

    You may imagine that num[-1] = num[n] = -∞.

    For example, in array [1, 2, 3, 1], 3 is a peak element and your function should return the index number 2.

    Your solution should be in logarithmic complexity.

    Summary:

    找到数组中的局部最大数。

    Solution:

    1. 顺序查找:最直接的方法,复杂度为O(n)

     1 class Solution {
     2 public:
     3     int findPeakElement(vector<int>& nums) {
     4         int len = nums.size();
     5         if (len == 1) {
     6             return 0;
     7         }
     8         
     9         for (int i = 0; i < len; i++) {
    10             if (!i && nums[i] > nums[i + 1] || 
    11                 i == len - 1 && nums[i] > nums[i - 1] ||
    12                 nums[i] > nums[i - 1] && nums[i] > nums[i + 1]) {
    13                     return i;
    14                 }
    15         }
    16         
    17         return -1;
    18     }
    19 };

    2. 二分查找:首先找到整体的中间值m,若m符合局部最大条件则返回m,否则若nums[m - 1] > nums[m]则在[0, m - 1]中查找。因为数组左边和右边为负无穷,所以在这种情况下[0, m - 1]中一定存在一个局部最大值。这种方法复杂度为O(logn)。

     1 class Solution {
     2 public:
     3     int findPeakElement(vector<int>& nums) {
     4         int len = nums.size();
     5         if (len == 1) {
     6             return 0;
     7         }
     8         
     9         int l = 0, r = len - 1;
    10         while (l <= r) {
    11             int m = (l + r) / 2;
    12             if ((!m || nums[m] >= nums[m - 1]) &&
    13                 (m == len - 1 || nums[m] >= nums[m + 1])) {
    14                     return m;
    15                 }
    16             if (m && nums[m] < nums[m - 1]) {
    17                 r = m - 1;
    18             }   
    19             else {
    20                 l = m + 1;
    21             }
    22         }
    23         
    24         return -1;
    25     }
    26 };

    二分查找的简略写法:

     1 class Solution {
     2 public:
     3     int findPeakElement(vector<int>& nums) {
     4         int len = nums.size();
     5         if (len == 1) {
     6             return 0;
     7         }
     8         
     9         int l = 0, r = len - 1;
    10         while (l < r) {
    11             int m = (l + r) / 2;
    12             if (nums[m] > nums[m + 1]) {
    13                 r = m;
    14             }
    15             else {
    16                 l = m + 1;
    17             }
    18         }
    19         
    20         return r;
    21     }
    22 };
  • 相关阅读:
    Search a 2D Matrix leetcode java
    Sqrt(int x) leetcode java
    Search for a Range leetcode java
    php获取客户端公网ip代码
    ddns+ros(routeros)+centos7.6+nginx+php+dnspod
    limits.conf文件修改注意事项,限制文件描述符数和进程数
    阿里云本地存储网关的一些特点和注意事项
    ROS根据访问不同的网址,走不同的路由策略的脚本
    漫威所有电影的 按时间线的观影顺序
    sklearn—特征工程
  • 原文地址:https://www.cnblogs.com/VickyWang/p/6242160.html
Copyright © 2011-2022 走看看