[leetcode]162. Find Peak Element

原创 2016年08月28日 14:18:14
class Solution {
public:
    int findPeakElement(vector<int>& nums) {
        
        int l=0;
        int r=nums.size()-1;
        
        return find(nums,l,r);
    }
    int find(vector<int>& nums,int l,int r)
    {
        if(l==r)
        return l;
        int mid=(l+r)/2;
        if(nums[mid]>nums[mid+1])
            return find(nums,l,mid);
        else 
            return find(nums,mid+1,r);
    }
};

版权声明:本文为博主原创文章,未经博主允许不得转载。

【LeetCode】 162. Find Peak Element

162. Find Peak Element介绍

LeetCode 162. Find Peak Element

LeetCode 162. Find Peak Element 两种办法

Leetcode 162 Find Peak Element 查找峰值元素(极大值)

给出一个不含重复元素的数组num,找出其中的峰值元素(极大值)并返回其索引(下标)值....

<LeetCode OJ> 162. Find Peak Element

162. Find Peak ElementMy SubmissionsQuestion Total Accepted: 56981 Total Submissions: 174002 Difficu...

LeetCode - 162. Find Peak Element

题目中给出了一个很重要的假设,就是数组左侧左边和右侧右边的数都是负无穷大,所以我们可以采用一个很方便的算法进行计算。 我们从index为1的时候开始扫描整个数组,比较nums[i]和nums[i -...

LeetCode(162) Find Peak Element

题目如下: A peak element is an element that is greater than its neighbors. Given an input array where nu...

【leetcode】162. Find Peak Element

Difficulty:medium A peak element is an element that is greater than its neighbors. Given...

Find Peak Element - LeetCode 162

题目描述: A peak element is an element that is greater than its neighbors. Given an input array where nu...
  • bu_min
  • bu_min
  • 2015年05月16日 21:22
  • 230

[LeetCode]162.Find Peak Element

【题目】 A peak element is an element that is greater than its neighbors. Given an input array where ...

LeetCode(162) Find Peak Element

题目A peak element is an element that is greater than its neighbors.Given an input array where num[i] ...
  • fly_yr
  • fly_yr
  • 2015年12月05日 14:08
  • 492
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:[leetcode]162. Find Peak Element
举报原因:
原因补充:

(最多只允许输入30个字)