-
Notifications
You must be signed in to change notification settings - Fork 2
/
MajorityElement.java
39 lines (36 loc) · 994 Bytes
/
MajorityElement.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
package frequent.medium;
/**
* 169. Majority Element
*
* Given an array nums of size n, return the majority element.
*
* The majority element is the element that appears more than ⌊n / 2⌋ times.
* You may assume that the majority element always exists in the array.
*
*
* Example 1:
*
* Input: nums = [3,2,3]
* Output: 3
* Example 2:
*
* Input: nums = [2,2,1,1,1,2,2]
* Output: 2
*
* IMP-1: Common. Question is super simple and servers a good example to understand the Boyer-Moore Voting Algorithm.
* For a more detailed description , see the algorithm description at leetcode.
* https://leetcode.com/problems/majority-element/solution/
*/
public class MajorityElement {
public int majorityElement(int[] nums) {
int candidate = 0;
int count = 0;
for (int num : nums) {
if (count == 0) {
candidate = num;
}
count += num == candidate ? 1 : -1;
}
return candidate;
}
}