Find Peak Element

Description:

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.

问题描述

在一串数中(相邻元素不等)找寻峰值元素，峰值元素的特点是比其邻近元素都要大，数组中可能有多个峰值元素，返回其中一个峰值元素的索引即可。。

解法一

思路：

这道题目很有意思，直观看起来并不是用二分查找来解题的。。但是通过nums[i-1] nums[i] nums[i+1]可以弄出二分解法
具体描述：
1 nums[i-1] < nums[i] > nums[i+1]—–>nums[i]
2.nums[i-1] < nums[i] < nums[i+1]——>nums[i+1…..n]
3.nums[i-1] > nums[i] > nums[i+1]——> nums[0…….i-1]
4. nums[i