-
Notifications
You must be signed in to change notification settings - Fork 3
/
Problem-2.java
62 lines (49 loc) · 1.13 KB
/
Problem-2.java
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
/**
* @author AkashGoyal
*/
/**
--------------------- Problem----------->> find majority element
Problem Link :- https://practice.geeksforgeeks.org/problems/majority-element-1587115620/1
Reference:- https://www.youtube.com/watch?v=AoX3BPWNnoE
*/
class Solution
{
static int majorityElement(int a[], int size)
{
// your code here
int major_element=-1;
int major_count=0;
for(int i=0;i<size;i++)
{
if(major_element==-1)
{
major_element=a[i];
}
if(major_element==a[i])
{
major_count++;
}
else
{
major_count--;
}
if(major_count==0)
{
major_element=-1;
}
}
int count=0;
for(int i=0;i<size;i++)
{
if(major_element==a[i])
{
count++;
}
}
if(count>size/2)
{
return major_element;
}
return -1;
}
}