414 Third Maximum Number

最新推荐文章于 2024-11-21 00:03:46 发布

佛系城

最新推荐文章于 2024-11-21 00:03:46 发布

阅读量174

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode

本文链接：https://blog.youkuaiyun.com/fujch3/article/details/75098377

Leetcode 同时被 2 个专栏收录

108 篇文章

订阅专栏

Leetcode_array

20 篇文章

订阅专栏

本文介绍了一种在非空整数数组中寻找第三大数的算法，并提供了具体实现案例。当数组中不存在第三大数时，则返回最大数。文章通过排序和去重实现了O(n)的时间复杂度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目来源【Leetcode】

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.

这道题比较简单，就是求第三大的数，考虑好几种特殊情况就没啥问题了

class Solution {
public:
    int thirdMax(vector<int>& nums) {
        int s = nums.size();
        if(s == 0) return 0;
        sort(nums.begin(),nums.end());
        nums.erase(unique(nums.begin(),nums.end()),nums.end());
        if(nums.size() == 1) return nums[0];
        else if(nums.size() == 2)  return nums[1];
        else if(nums.size() == 3)  return nums[0];
        else return nums[nums.size()-3];
    }
};