Leetcode-majority Element

Majority Element

2015.1.23 17:46

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

Assume that the array was non-empty and the majority element always exist in the array.

Solution:

This is the FAQ, you know. See the code below.

Total time complexity is O (n). Space complexity is O (1).

Accepted Code:

1 //1AC, old2 classSolution {3  Public:4     intMajorityelement (vector<int> &num) {5         intVal, CNT;6         intn, I;7         8n = (int) num.size ();9val = num[0];TenCNT =1; One          A          for(i =1; I < n; ++i) { -             if(val = =Num[i]) { -++CNT; the}Else if(CNT >1) { ---CNT; -}Else { -val =Num[i]; +CNT =1; -             } +         } A          at         returnVal; -     } -};

Leetcode-majority Element