#75 Find Peak Element

题目描述：

There is an integer array which has the following features:

• The numbers in adjacent positions are different.
• A[0] < A[1] && A[A.length - 2] > A[A.length - 1].

We define a position P is a peek if:

A[P] > A[P-1] && A[P] > A[P+1]

Find a peak element in this array. Return the index of the peak.

 Notice

The array may contains multiple peeks, find any of them.

Have you met this question in a real interview? 

Yes

Example

Given [1, 2, 1, 3, 4, 5, 7, 6]

Return index 1 (which is number 2) or 6 (which is number 7)

Challenge 

Time complexity O(logN)

题目思路：

这题也是用二分法呀二分法，求出mid，然后根据A[mid], A[mid - 1], A[mid + 1]之间的关系来缩小范围就是了。

Mycode（AC = 15ms）：

class Solution {
public:
    /**
     * @param A: An integers array.
     * @return: return any of peek positions.
     */
    int findPeak(vector<int> A) {
        // write your code here
        if (A.size() <= 2) {
            return -1;
        }
        
        int l = 1, r = A.size() - 2;
        while (l < r) {
            int mid = (l + r) / 2;
            
            // if satisfy the peak condition, return index
            if (A[mid] > A[mid + 1] && A[mid] > A[mid - 1]) {
                return mid;
            }
            
            // if mid number < its right, or mid number > its left
            // then peak is on its right
            else if (A[mid] < A[mid + 1] || A[mid] > A[mid - 1]) {
                l = mid + 1;
            }
            else {
                r = mid - 1;
            }
        }
        
        return l;
    }
};