第三大的数

class Solution {
public:
int thirdMax(vector& nums) {
int count=0;
sort(nums.begin(),nums.end());
if(nums.size()❤️)
{
return nums[nums.size()-1];
}
int thirdMax=nums[nums.size()-1];
for(int i=nums.size()-1;i>=0;i–)
{
if(nums[i]<thirdMax)
{
thirdMax=nums[i];
count++;
}
if(count==2)
{
return thirdMax;
}
}
if(count<2)
{
return nums[nums.size()-1];
}
return thirdMax;
}
};