forked from Harshita-Kanal/Data-Structures-and-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
cpp_MooreMooteVotingAlgo
68 lines (64 loc) · 1.43 KB
/
cpp_MooreMooteVotingAlgo
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
64
65
66
67
68
#include<bits/stdc++.h>
using namespace std;
int majorityElement(vector<int> &nums) {
int pres = nums[0],curr=1;
for(int i=1;i<nums.size();i++){
if(nums[i]==pres){
curr++;
}
if(nums[i]!=pres){
curr--;
}
if(curr==0){
pres = nums[i];
curr=1;
}
}
int count=0;
for(int i=0;i<nums.size();i++){
if(nums[i]==pres){
count++;
}
}
if(count>=nums.size()/2){
return pres;
}
return -1;
}
int main(){
vector<int> vect{2,2,1,1,1,2,2};
int output = majorityElement(vect);
cout<<output;
}
#include<bits/stdc++.h>
using namespace std;
int majorityElement(vector<int> &nums) {
int pres = nums[0],curr=1;
for(int i=1;i<nums.size();i++){
if(nums[i]==pres){
curr++;
}
if(nums[i]!=pres){
curr--;
}
if(curr==0){
pres = nums[i];
curr=1;
}
}
int count=0;
for(int i=0;i<nums.size();i++){
if(nums[i]==pres){
count++;
}
}
if(count>=nums.size()/2){
return pres;
}
return -1;
}
int main(){
vector<int> vect{2,2,1,1,1,2,2};
int output = majorityElement(vect);
cout<<output;
}