数组中出现次数超过一半的数字

 1 #include <iostream>
 2 #include <vector>
 3 
 4 using namespace std;
 5 
 6 class Solution {
 7 public:
 8     int MoreThanHalfNum_Solution(vector<int> numbers) {
 9         if (numbers.size() == 0)
10             return 0;
11         if (numbers.size() == 1)
12             return numbers.front();
13         vector<int> num(numbers);
14         int len = num.size() % 2 ? num.size() - 1 : num.size();
15         for (int i = 1; i < len; i+=2)
16         {
17             if (num[i - 1] != num[i])
18                 num[i - 1] = num[i] = -1;
19         }
20 
21         for (int i = 0; i < len; i++)
22         {
23             if (num[i]>0)
24             {
25                 return num[i];
26             }
27         }
28         return 0;
29     }
30 };
31 
32 
33 int main(void)
34 {
35     Solution *s = new Solution();
36     vector <int> vec{ 1, 2, 3, 2, 4, 2, 5, 2, 3 };
37     cout << s->MoreThanHalfNum_Solution(vec) << endl;
38     system("pause");
39     return 0;
40 }