-
Notifications
You must be signed in to change notification settings - Fork 0
/
SearchingSorting-MajorityElement.cpp
89 lines (62 loc) · 1.35 KB
/
SearchingSorting-MajorityElement.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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
// Function to find majority element in the array
// majority element is >n/2
// a: input array
// size: size of input array
bool findMajor(int a[],int n,int major){
int count=0;
for(int i=0;i<n;i++){
if(a[i]==major){
count++;
}
}
if(count>n/2){
return 1;
}
else{
return 0;
}
}
int majorityElement(int a[], int n)
{
// your code here
int major=a[0];
int count=1,count1=0;
for(int i=1;i<n;i++){
if(major==a[i]){
count++;
}
else{
count1++;
count--;
if(count==0){
major=a[i];
count=1;
}
}
}
if( findMajor(a,n,major)){
return major;
}
else{
return -1;
}
}
// { Driver Code Starts.
int main(){
int t;
cin >> t;
while(t--){
int n;
cin >> n;
int arr[n];
for(int i = 0;i<n;i++){
cin >> arr[i];
}
cout << majorityElement(arr, n) << endl;
}
return 0;
}
// } Driver Code Ends