Leetcode 414. Third Maximum Number

最新推荐文章于 2024-07-10 23:03:37 发布

原创最新推荐文章于 2024-07-10 23:03:37 发布 · 294 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Leetcode

Leetcode 同时被 2 个专栏收录

409 篇文章

订阅专栏

Algorithm

260 篇文章

订阅专栏

文章围绕Leetcode题目展开，包含题目描述和解决方案，有两个版本的解答，还给出了题目参考链接https://leetcode.com/problems/third-maximum-number/description/ 。

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

文章作者：Tyan
博客：noahsnail.com | 优快云 | 简书

1. Description

Third Maximum Number

2. Solution

Version 1

class Solution {
public:
    int thirdMax(vector<int>& nums) {
        long long first = LLONG_MIN;
        long long second = LLONG_MIN;
        long long third = LLONG_MIN;
        for(int i = 0; i < nums.size(); i++) {
            if(nums[i] <= third || nums[i] == first || nums[i] == second) {
                continue;
            }
            if(nums[i] > first) {
                third = second;
                second = first;
                first = nums[i];
            }
            else if(nums[i] > second) {
                third = second;
                second = nums[i];
            }
            else {
                third = nums[i];
            }
        }
        if(third == LLONG_MIN) {
            return first;
        }
        return third;
    }
};

Version 2

class Solution {
public:
    int thirdMax(vector<int>& nums) {
        set<int> values(nums.begin(), nums.end());
        if(values.size() < 3) {
            return *values.rbegin();
        }
        values.erase(--values.end());
        values.erase(--values.end());
        return *(--values.end());
    }
};