leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

0852.cpp (445B)

0 class Solution { 1 public: 2 int peakIndexInMountainArray(const vector<int> &arr) { 3 int low = 1, high = arr.size() - 2; 4 while (low <= high) { 5 int mid = low + (high - low) / 2; 6 if (arr[mid - 1] < arr[mid] && arr[mid] > arr[mid + 1]) return mid; 7 if (arr[mid - 1] < arr[mid]) 8 low = mid + 1; 9 else 10 high = mid - 1; 11 } 12 return -1; 13 } 14 };