Maximize the Topmost Element After K Moves LeetCode solution in Java

1
class Solution {
2
  public int maximumTop(int[] nums, int k) {
3
    int n = nums.length, max = -1;
4

5
    if (n == 1) {
6
      if (k % 2 == 1) return -1;
7
      else return nums[0];
8
    }
9

10
    if (k < n) max = nums[k];
11
    else if (k > n) k = n + 1;
12

13
    for (int i = 0; i < k - 1; i++) {
14
      max = Math.max(max, nums[i]);
15
    }
16
    return max;
17
  }
18
}