Maximize the Topmost Element After K Moves LeetCode solution in C++

1
class Solution {
2
 public:
3
  int maximumTop(vector<int> &nums, int k) {
4
    int n = nums.size();
5
    if (n == 1 && (k & 1)) {
6
      return -1;
7
    }
8
    int mxm = -1;
9
    for (int i = 0; i < n && i < k - 1; i++) {
10
      mxm = max(mxm, nums[i]);
11
    }
12
    if (k < n) {
13
      mxm = max(mxm, nums[k]);
14
    }
15
    return mxm;
16
  }
17
};