lc414. Third Maximum Number

414. Third Maximum Number Easy

380

690

Favorite

Share 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.

扫描二维码关注公众号，回复： 6602505 查看本文章

思路：集合过滤重复数字，然后转换为数组，排序，大于等于三个，输出第三个，否则输出第一个元素 代码：python3

class Solution:
    def thirdMax(self, nums):
        s = set(nums)
        arr=list(s)
        arr.sort(reverse=True)
        if len(arr)>=3:
        	return arr[2]
        else:
        	return arr[0]
复制代码

转载于:https://juejin.im/post/5d03045ff265da1bb47d603d