Majority Element II

Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1) space.

Hint:

1. How many majority elements could it possibly have?
2. Do you have a better hint? Suggest it!

   class Solution {
   public:
       vector<int> majorityElement(vector<int>& nums) {
           int i;
           int count1,count2;
           int num1,num2;
           int n=nums.size();
           vector<int> res;
           count1=0;
           count2=0;
           for(i=0;i<n;i++){
               if(count1==0 || num1==nums[i]){
                   num1=nums[i];
                   count1++;
               }
               else if(count2==0 || num2==nums[i]){
                       num2=nums[i];
                       count2++;
                   }
               else
               {
                   count1--;
                   count2--;
               }
           }
           count1=0;
           count2=0;
           for(i=0;i<n;i++)
           {
               if(num1==nums[i])
                 count1++;
               else if(num2==nums[i])
                 count2++;
               
           }
           if(count1>n/3)
             res.push_back(num1);
           if(count2>n/3)
             res.push_back(num2);
             return res;
       }
   };