414. Third Maximum Number*

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

C++ 实现 1

注意第三个例子, 相同元素要过滤. 另外, 如果数组中存在 INT32_MIN, 并且刚好是第三大的元素, 比如 [2, 1, INT32_MIN], 这个时候不应该返回数组中的最大值, 但如果按照如下代码最后的返回逻辑, 将会返回 first. 这是有问题的. 因此, first 等的类型设置为 long.

class Solution {
public:
    int thirdMax(vector<int>& nums) {
        long first = INT64_MIN, second = INT64_MIN, third = INT64_MIN;
        for (auto &a : nums) {
            if (a > first) {
                third = second;
                second = first;
                first = a;
            } else if (a > second) {
                if (a == first) continue;
                third = second;
                second = a;
            } else if (a > third) {
                if (a == second) continue;
                third = a;
            }
        }
        return third == INT64_MIN ? (int)first : (int)third;
    }
};

C++ 实现 2

另一种写法. 来自 LeetCode Submission.

class Solution {
public:
    int thirdMax(vector<int>& nums) {
        long first = LONG_MIN, second = LONG_MIN, third = LONG_MIN;
        for (int num : nums) {
            if (num == first || num == second || num == third) continue;
            if (num > first) {
                third = second;
                second = first;                
                first = num;
            } else if (num > second) {
                third = second;
                second = num;
            } else if (num > third) {
                third = num;
            }
        }
        return third == LONG_MIN ? first : third;
    }
};