lc162-Find Peak Element 發表於 2016-12-13 | 分類於 leetcode | 0 comments | 12345678910111213141516class Solution {public: int findPeakElement(vector<int>& nums) { int h = nums.size()-1; int l = 0; while(l<h-1) { int mid = (h+l)/2; if (nums[mid-1] < nums[mid]) { if (nums[mid] > nums[mid+1]) return mid; l = mid+1; } else h = mid-1; } return (nums[l]>nums[h])?l:h; }};