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.
Subscribe to see which companies asked this question

---

我的代码

12ms代码：

class Solution {
public:
    int thirdMax(vector<int>& nums) {
        int first,first0=1;
        int second,second0=1;
        int third,third0=1;
        int len=nums.size();
        int number;

        vector<int> num2(nums);
        sort(num2.begin(),num2.end());
        first=num2.back();

        if(len<2)
            number= first;
        else
        {
            int i=len-2;
            while(i!=0&&second0==1)
            {
                if(num2[i]!=first)
                {
                    second=num2[i];
                    second0=0;
                    break;
                }
                i--;
            }
             while(i!=0&&third0==1)
            {
                i--;
                if(num2[i]!=second)
                {
                    third=num2[i];
                    number= third;
                    third0=0;
                    break;
                }
            }
            if(third0==1)
            number= first;
        }
        return number;
    }
};

排完序，在从最大值开始，往下比较并计数，返回。

---

6ms代码

class Solution {
public:
    int thirdMax(vector<int>& nums) {
        int len=nums.size();
        int number;
        int first=INT_MIN,second=INT_MIN,third=INT_MIN;
        int count=0,bottom=0;
        if(len==1)
          return first=nums[0];
        else if(len==2)
            return first=max(nums[0],nums[1]);
        else
        {
            for(int i=0;i<len;i++)
            {
                if(nums[i] == INT_MIN) bottom = 1;//说明存在有一个数不需要更新
                if(nums[i]==first||nums[i]==second||nums[i]==third)
                    continue;//很重要的一句!目的是跳过相同的数
                if(nums[i]>first)
                {
                    third=second;
                    second=first;
                    first=nums[i];
                    count++;
                }
                else if(nums[i]>second)
                {
                    third=second;
                    second=nums[i];
                    count++;
                }
                else if(nums[i]>third)
                {
                    third=nums[i];
                    count++;//count代表更新的次数
                    //3次或以上必然存在第三小的值，2次时候需要看看是不是有一个数根本不需要更新
                }
            }

            if(count+bottom>=3)
            number=third;
            else
            number=first;
            return number;
        }
    }
};

就循环了一次，检查第三小的值是否更新，或本来就不用更新。