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).
给定一个非空的正数数组,返回数组中第三大的数。如果不存在,则返回最大的数,时间复杂度必须是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.
Solution:
Python
class Solution:
def thirdMax(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
nums = sorted(set(nums))
if len(nums)<3:
return nums[-1]
return nums[-3]
C++
class Solution {
public:
int thirdMax(vector<int>& nums) {
set<int> top3; #set为关联性容器,内部的值是唯一的,且按照升序排列好
for (int num :nums){
top3.insert(num); #插入元素
if (top3.size()>3){
top3.erase(top3.begin()); #删除起始元素,即size大于3时,删除排名第四的元素,保持top3中只有三个元素
}
}
return top3.size() == 3 ? *top3.begin() : *top3.rbegin(); #top3的size为3,则返回第三个元素,否则返回末尾元素,即top3中最大值,关于rbegin和end的区别参考下面的博客
}
};
关于C++的begin,end,rbegin,rend的用法参考博客:
https://blog.csdn.net/z2014jw/article/details/50810569?utm_source=blogxgwz1