作业（十二）——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.

思路

    像寻找最大数一样，遍历列表。不过找第三大的数，需要维护一个容量为3的列表的状态，这个列表储存最大的三个数。

    每次都判断数是否已在列表中；

    没有就判断列表满了3个没；

    没满直接加入，满了则与列表中最小的数比较，若大于就替换掉。

代码

class Solution:
    def thirdMax(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        a=[]
        for x in nums:
            if x not in a:
                if len(a)<3:
                    a.append(x)
                elif x>min(a):
                    a[a.index(min(a))]=x
        if len(a)<3:
            return max(a)
        return min(a)

结果