LintCode 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 peak 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
It’s guaranteed the array has at least one peak.
The array may contain multiple peeks, find any of them.
The array has at least 3 numbers in it.
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)
Tags
Array LintCode Copyright Binary Search Google

思路

二分。当$A[mid]<A[mid+1]$，说明峰值在右边，反之在左边。

代码

class Solution:
    """
    @param: A: An integers array.
    @return: return any of peek positions.
    """
    def findPeak(self, A):
        # write your code here
        start = 0; end = len(A) - 1
        while start < end:
            mid = start + (end - start) // 2
            if A[mid] > A[mid + 1]: end = mid
            else: start = mid + 1
        return start