[LeetCode]Find Peak Element

Find Peak Element

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.

click to show spoilers.

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

 这道题就是变相的求数组的最大值。

二分搜索，时间复杂度O(n)。

 1 class Solution {
 2 public:
 3     int findPeakElement(vector<int>& nums) {
 4         int left=0,right=nums.size()-1;
 5         while(left<right)
 6         {
 7             int mid = (left+right)/2;
 8             if(nums[mid]<nums[mid+1])
 9             {
10                 left = mid+1;
11             }
12             else
13             {
14                 right = mid;
15             }
16         }
17         return left;
18     }
19 };

[LeetCode]Find Peak Element

原文：http://www.cnblogs.com/Sean-le/p/4796312.html