414. Third Maximum Number

题意：Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n).

Example 1:

Input: [3, 2, 1]

Output: 1

Explanation: The third maximum is 1.

Example 2:

Input: [1, 2]

Output: 2

Explanation: The third maximum does not exist, so the maximum (2) is returned instead.

Example 3:

Input: [2, 2, 3, 1]

Output: 1

Explanation: Note that the third maximum here means the third maximum distinct number.
Both numbers with value 2 are both considered as second maximum.

思路：这题思路和334. Increasing Triplet Subsequence一样 ，通过if-else结构来找第三大的数，唯一的不同是可能有重复的数字，所以多了不等的判断：

class Solution(object):
    def thirdMax(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        top1=top2=top3=float('-inf')
        for i in nums:
            if i>top1:
                top1,top2,top3 = i,top1,top2
            elif i>top2 and i!=top1:
                top2,top3 = i,top2
            elif i>top3 and i!=top1 and i!=top2:
                top3 = i
        return top1 if top3==float('-inf') else top3

这里还有一个别人的代码，利用python的set结构的快速性来解决：

def thirdMax(self, nums):
        nums = set(nums)
        if len(nums) < 3:
            return max(nums)
        nums.remove(max(nums))
        nums.remove(max(nums))
        return max(nums)