leetcodeSolution to some Leetcode problems written in C++ |
git clone git://git.dimitrijedobrota.com/leetcode.git |
Log | Files | Refs | README | LICENSE |
0162.cpp (415B)
0 class Solution {
1 public:
2 int findPeakElement(vector<int> &nums) {
3 int n = nums.size();
4 if (n == 1) return 0;
6 for (int i = 0; i < n - 1;) {
7 if (nums[i] > nums[i + 1]) return i;
8 i += 2;
9 if (i >= n) break;
10 if (nums[i - 1] > nums[i]) return i - 1;
11 }
12 if (nums[n - 1] > nums[n - 2]) return n - 1;
14 return -1;
15 }
16 };