Majority Element (Leet Code)

Majority Element

 Total Accepted: 58215 Total Submissions: 16289

Question Solution 

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.

You may assume that the array is non-empty and the majority element always exist in the array.

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

Show Tags

Show Similar Problems

1

class Solution {public:    int majorityElement(vector<int> &num) {    int count=0;      int current;      int size=num.size();    for(int i=0;i<size;i++)      {          if(count==0)          {              current=num[i];              count=1;            }          else          {              if(num[i]==current)                  count++;              else                  count--;          }      }      return current;      }};