1
class Solution:
2
    def thirdMax(self, nums: List[int]) -> int:
3
        nums_set = set(nums)
4
        sorted_set = sorted(nums_set)
5
        return sorted_set[-3] if len(nums_set) > 2 else sorted_set[-1]
6

7
        # use set() to remove dups
8
        # if len of nums after dups have been removed is at least 2, a third max val must exist
9
        # if not, just return the max
10

11
        # you can do it in 1 line like this but then you have to call the same functions repeatedly
12
        # return sorted(set(nums))[-3] if len(set(nums)) > 2  else sorted(set(nums))[-1]