Find Peak Element LeetCode solution in C++

1
class Solution {
2
 public:
3
  int findPeakElement(vector<int> &nums) {
4
    int peak = 0;
5
    for (int i = 1; i < nums.size(); i++) {
6
      if (nums[i] > nums[i - 1]) peak = i;
7
    }
8
    return peak;
9
  }
10
};