1. 162

find-peak-element

2.算法

• 二分查找

• O(lgn)

3.算法

class Solution {

public:

    int findPeakElement(vector<int>& nums) {

        int low=0;

        int high=nums.size()-1;

        while(low<high){

            int mid=low+(high-low)/2;

            if(nums[mid]>nums[mid+1])

                high=mid;

            else

                low=mid+1;

        }



        return low;

    }

};