-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMajority Number III.cpp
63 lines (61 loc) · 1.45 KB
/
Majority Number III.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
#include <iostream>
#include <vector>
using namespace std;
struct element {
int val;
int count;
element(int x = 0, int y = 0) : val(x), count(y) {}
};
class Solution {
public:
/**
* @param nums: A list of integers
* @param k: As described
* @return: The majority number
*/
int majorityNumber(vector<int> nums, int k) {
// write your code here
int len = nums.size();
if(len == 0) return -1;
vector<element> m(k - 1, element());
for(int i = 0; i < len; i++) {
int l;
for(l = 0; l < k - 1; l++) {
if(m[l].val == nums[i]) {
m[l].count++;
break;
}
}
if(l == k - 1) {
for(l = 0; l < k - 1; l++) {
if(m[l].count == 0) {
m[l].val = nums[i];
m[l].count++;
break;
}
}
if(l == k - 1) {
for(l = 0; l < k - 1; l++) {
m[l].count--;
}
}
}
}
for(int j = 0; j < k - 1; j++) {
m[j].count = 0;
}
for(int i = 0; i < len; i++) {
for(int j = 0; j < k - 1; j++) {
if(m[j].val == nums[i]) m[j].count++;
if(m[j].count > len / k) return m[j].val;
}
}
return -1;
}
};
int main() {
int arr[] = {3,1,2,3,2,3,3,4,4,4};
std::vector<int> v(arr, arr + 10);
Solution s;
cout << s.majorityNumber(v, 3) << endl; return 0;
}