162. 寻找峰值

 1 class Solution 
 2 {
 3 public:
 4     int findPeakElement(vector<int>& nums) 
 5     {
 6         int l = 0,r = nums.size() - 1;
 7         while(l < r)
 8         {
 9             int mid = l + r >> 1;
10 
11             //nums[mid] > nums[mid + 1]就说明在mid左边以及mid处能找到峰值
12             if(nums[mid] > nums[mid + 1]) r = mid;
13             else l = mid + 1;
14         }
15         return l;
16     }
17 };