[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 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) {
        long Max = LONG_MIN, secMax = LONG_MIN, thirdMax = LONG_MIN;
        for(auto num: nums)
        {
            if(num > Max)
            {
                if(secMax!=LONG_MIN) thirdMax = secMax;
                if(Max!=LONG_MIN) secMax = Max;
                Max = num;
            }
            else if(num > secMax && num!= Max)
            {
                if(secMax!=LONG_MIN) thirdMax = secMax;
                secMax = num;
            }
            else if(num > thirdMax && num!= Max && num!=secMax) thirdMax = num;
        }
        return thirdMax==LONG_MIN?Max:thirdMax;
    }
};