class Solution: def findMaxK(self, nums: List[int]) -> int: nums.sort(reverse=True) for i in nums: if -i in nums: return abs(i) else: return -1