class Solution:
def findMaxK(self, nums: List[int]) -> int:
nums.sort()
over = False
for e in nums:
for e2 in nums[::-1]:
if e > 0:
over = True
break
if abs(e) == e2:
return e2
if over:
break
return -1