[Leetcode] 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.

分析

这道题在思路上不难，使用三个变量分别储存第一大，第二大以及第三大的数，需要注意到地方有：
1. 重复元素的处理；
2. 第三大的数不存在的情况；
3. 第三大的数为整型最小值的情况；

代码

class Solution {
public:
    int thirdMax(vector<int>& nums) {
        long max1 = LONG_MIN, max2 = LONG_MIN, max3 = LONG_MIN;
        for (int i = 0; i < nums.size(); i++) {
            if (nums[i] == max1 || nums[i] == max2 || nums[i] == max3) continue;
            if (nums[i] > max1) { max3 = max2; max2 = max1; max1 = nums[i];}
            else if (nums[i] > max2) { max3 = max2; max2 = nums[i];}
            else if (nums[i] > max3) { max3 = nums[i];}
        }
        if (max3 == LONG_MIN) return max1;
        return max3;
    }
};