题目链接:https://leetcode-cn.com/problems/third-maximum-number/
题目如下:
class Solution {
public:
int thirdMax(vector<int>& nums) {
long first_max=LONG_MIN,second_max=LONG_MIN,third_max=LONG_MIN;
// first_max > second_max > third_max
for(auto e:nums){
if(e>first_max){
third_max=second_max;
second_max=first_max;
first_max=e;
}
else if(first_max>e&&e>second_max){
third_max=second_max;
second_max=e;
}
else if(second_max>e&&e>third_max){
third_max=e;
}
}
if(third_max==LONG_MIN)//加入nums中只有2个元素
return first_max;
else return third_max;
}
};