[LeetCode]414. Third Maximum Number

墨衍会员 · AI 创作全网分发 墨衍智能分发 本文由作者通过墨衍一键同步至各平台 1分发平台 300+累计阅读 369平均单平台已同步平台 CSDN 微信公众号微博知乎掘金百家号博客园抖音小红书 你的文章也可以这样分发 墨衍会员 ¥399起/年，写一次发全网我也要 → 码龄11年

关注

原创最新推荐文章于 2024-10-20 07:15:00 发布 369 阅读 AI 写同款· GEO 优化 ›

AI权益加码！Claude Code、Cursor等20+工具免费用！购周边限时加赠Coding Plan Lite，畅享主流AI工具！学习进阶更高效！阅读详情

[LeetCode]414. Third Maximum Number

题目描述

这里写图片描述

思路

map可解，开始的思路是o(n)空间
参考答案，可以用o(1)空间的解法

代码

#include <iostream>
#include <map>
#include <set>
#include <vector>

using namespace std;

class Solution {
public:
    int thirdMax(vector<int>& nums) {
        /*
        map<int, int> m;
        for (int num : nums)
            m[num]++;
        int cur_count = 3;
        for (auto iter = m.rbegin(); iter != m.rend(); iter++) {
            cur_count--;
            if (cur_count == 0) return iter->first;
        }

        if (cur_count > 0)
            return m.rbegin()->first;
        */

        set<int> s;
        for (int num : nums) {
            s.insert(num);
            if (s.size() > 3) s.erase(s.begin());
        }
        return s.size() == 3 ? *s.begin() : *s.rbegin();
    }
};

int main() {
    vector<int> nums = { 3, 2,2,2,2,2, 1 };
    Solution s;

    cout << s.thirdMax(nums) << endl;

    system("pause");
    return 0;
}

收录于

leetcode

当前文章被收录于：

leetcode

184 篇文章 0 人学习

订阅专栏查看详情

当前文章被以下社区和专栏收录：

标签

#leetcode

本内容遵循 CC 4.0 BY-SA 版权协议

Leetcode414. Third Maximum Number @小花刚开始写一些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 compl 阅读详情

相关推荐

LeetCode 414. Third Maximum Number

414. Third Maximum Number （第三大的数）链接：　　　　https://leetcode-cn.com/problems/third-maximum-number/ 题目：　　　　给定一个非空数组，返回此数组中第三大的数。如果不存在，则返回数组中最大的数。要求算法时间复杂度必须是O(n)。　　示例 1: 　　输入: [3, 2, 1]...

weixin_30522183的博客 205

【leetcode】414. Third Maximum Number

problem 414.Third Maximum Number solution 思路：用三个变量first, second, third来分别保存第一大、第二大和第三大的数，然后遍历数组。 class Solution { public: int thirdMax(vector<int>& nums) { //1.LONG_MIN...

weixin_30293079的博客 108

LeetCode 414.Third Maximum Number

LeetCode 414.Third Maximum NumberDescription: 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

My Blog 360

LeetCode //C - 414. Third Maximum Number

【代码】LeetCode //C - 414. Third Maximum Number。

Made in Code 850

[leetcode] 414. Third Maximum Number 解题报告

题目链接：https://leetcode.com/problems/third-maximum-number/ 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 t

小榕流光的专栏 2185

Leetcode 414. Third Maximum Number

// 要求时间复杂度为O(n),所以不能进行排序 int thirdMax(vector<int>& nums) { if (nums.size() == 0) return -1; long one = LONG_MIN;// 这么写的原因是因为int的最小值INT_MIN,如果将one写成 int one = INT_MIN // ,那么如果nums里面第三个数是I...

无知的博客 125

[leetcode] 414. Third Maximum Number

Description 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: ...

Learning from the mistakes 188

LeetCode 414. Third Maximum Number. C++

414. Third Maximum Number 题目 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). Input: [3, 2, 1] Output: 1 Explanation: The third maximu

Hello 1467

leetcode 414. Third Maximum Number

目录一、问题分析二、代码实现 1、排序 2、HashSet去重+小顶堆 3、TreeSet（去重+有序） 4、类似成绩等级划分的方法 https://leetcode.com/problems/third-maximum-number/ 给定一个非空数组，返回第三大的数字，如果不存在则返回数组的最大数字。一、问题分析测试用例： Example 1: In...

小景的博客 273

LeetCode 414 Third Maximum Number

Problem: Given anon-emptyarray of integers, return thethirdmaximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n). Example 1: In...

dilian4850的博客 113

leetcode简单题 414. Third Maximum Number

题目描述： 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,...

zimengxueying的博客 225

Leetcode Third Maximum Number 414

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]Outp

我心中有猛虎细嗅蔷薇 559

leetcode414. Third Maximum Number

ProgrammingLearner的博客 640

LeetCode 414. Third Maximum Number【数组】简单

414. Third Maximum Number 【easy】 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...