Leetcode-414. Third Maximum Number

414. 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)
    {
       int minval,value3=nums[0];
       for(int i=1;i<nums.size();i++)
       {
           minval=nums[i]<value3?nums[i]:value3;
           value3=minval;
       }
       int maxval,secval,thival,value=value3,value1=value3,value2=value3,maxcount=0,secount=0;
       for(int i=0;i<nums.size();i++)
       {
           maxval=nums[i]>value?nums[i]:value;
           value=maxval;
       }  
       for(int i=0;i<nums.size();i++)
       {
           if(nums[i]==value)
           {
               nums[i]=value3;
               ++maxcount;
           }
       }
       for(int i=0;i<nums.size();i++)
       {
           secval=nums[i]>value1?nums[i]:value1;
           value1=secval;
       }
       for(int i=0;i<nums.size();i++)
       {
           if(nums[i]==value1)
           {
               nums[i]=value3;
           ++secount;

           }
       }
        for(int i=0;i<nums.size();i++)
       {
           thival=nums[i]>value2?nums[i]:value2;
           value2=thival;
       }
       if(maxcount+secount>=nums.size())
       return value;
       else return value2;
     }
};