Majority Element

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.

1. int majorityElement(vector<int> &num) {
3. int nSize = num.size();
4. int time = 0;
5. int curValue = -1;
6. for(int i=0;i<nSize;i++) {
7. if(time == 0) {
8. curValue = num[i];
9. time = 1;
10. } else {
11. if(num[i] == curValue) {
12. time++;
13. } else {
14. time--;
15. }
16. }
17. }
18. return curValue;
19. }