Maximize the Topmost Element After K Moves LeetCode solution in Python

1
# Runtime: 498 ms (Top 63.4%) | Memory: 30.38 MB (Top 40.6%)
2

3

4
class Solution:
5
    def maximumTop(self, nums: List[int], k: int) -> int:
6
        if len(nums) == 1:
7
            if k % 2 != 0:
8
                return -1
9
            return nums[0]
10

11
        if k == 0:
12
            return nums[0]
13
        if k == len(nums):
14
            return max(nums[:-1])
15
        if k > len(nums):
16
            return max(nums)
17
        if k == 1:
18
            return nums[1]
19
        m = max(nums[: k - 1])
20
        m = max(m, nums[k])
21
        return m