Leetcode -229. Majority Element

最新推荐文章于 2016-03-06 14:45:17 发布

Neo_邪风

最新推荐文章于 2016-03-06 14:45:17 发布

阅读量227

点赞数

分类专栏： leetcode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/u010738052/article/details/50572678

版权

leetcode 专栏收录该内容

57 篇文章 0 订阅

订阅专栏

Problem Description:
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.

Analysis:
Moore Voting Algorithm
The essential concepts is you keeps a counter for the majority number X. If you find a number Y not equal X, the current counter should reduce 1. otherwise the counter + 1. Since the problem is finding the majority for more than [n / 3], so there would be less than or equal to two numbers. So we set two candidates and use two counters to record the occurrence. After select the two candidates we still need to check the candidates is the majority number or not.

Code:

vector<int> majorityElement(vector<int>& nums) {
     int candidate1 = 0, count1 = 0;
     int candidate2 = 0, count2 = 0;
     vector<int> res;
     for (auto i : nums)
        {
            if (i == candidate1)
                count1++;
            else if (i == candidate2)
                count2++;
            else if (count1 == 0) 
                {
                    candidate1 = i;
                    count1 = 1;
                } 
            else if (count2 == 0)
                {
                    candidate2 = i;
                    count2 = 1; 
                }
            else {
                count1--;
                count2--;
            }
        }
          count1 = count2 = 0;
    for(int n: nums){
        if (n == candidate1)   count1++;
        else if (n == candidate2) count2++;
    }
       if (count1 > nums.size() / 3) res.push_back(candidate1);
       if (count2 > nums.size() / 3) res.push_back(candidate2);
       return res;
    }

Follow up :
Given an array of integers and a number k, the majority number is the number that occurs more than 1/k of the size of the array.
There is only one majority number in the array.
Challenge
O(n) time and O(k) extra space

Analysis:
we need to maintain a hashtable to store the

int majorityNumber(vector<int> nums, int k) {
        // write your code here
        unordered_map<int, int> mp;
        for (auto num : nums)
        {
            if(mp.find (num) != mp.end()) 
                mp[num]++;
            else
            {
                if (mp.size() < k)
                {
                    mp[num]++;   
                }
                else {
                     vector<int> v;
                    for (auto i : mp)
                      {
                           i.second--;
                        if (i.second == 0)
                         v.push_back(i.first);
                      }
                      for (int i : v)
                      mp.erase(i);
                }
            }
        }

        for (auto i : mp)
           i.second = 0;
        int maxcount = 0;
        int maxkey = 0;
        for (auto i : nums)
        {
            if(mp.find(i) == mp.end())continue;
                mp[i]++;
            if(maxcount < mp[i])
              {
                  maxcount = mp[i];
                  maxkey = i;
              }
        }
        return maxkey;
    }
};