162. Find Peak Element

Description:

https://leetcode.com/problems/find-peak-element/#/description

Algorithm:

squeeze

Code:

class Solution {
public:
int findPeakElement(vector<int>& nums) {
int start = 0;
int end = nums.size() - 1;
while (start < end)
{
int middle = (start + end) / 2;
if (nums[middle] < nums[middle + 1])
start = middle + 1;
else
end = middle;
}
return start;
}
};

Timing & Space:

O(logn) & O(1)