class Solution(object):
def thirdMax(self, nums):
"""
val = []
if len(nums) != 0:
nums.sort()
length = len(nums)
for i in range(length):
if not nums[i] in val:
if len(val) < 3:
val.append(nums[i])
elif min(val) < nums[i]:
val.pop(0)
val.append(nums[i])
if len(val) < 3:
return max(val)
else:
return min(val)
"""