-
Notifications
You must be signed in to change notification settings - Fork 2
/
MajorityElement.java
46 lines (42 loc) · 1.22 KB
/
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
40
41
42
43
44
45
46
public class DivideAndConquerSolution {
public int majorityElementDivideAndConquer(int[] num) {
if (num.length == 1 || num.length == 2) {
return num[0];
}
int left = majorityElement(Arrays.copyOfRange(num, 0, (num.length-1)/2+1));
int right = majorityElement(Arrays.copyOfRange(num, (num.length-1)/2+1, num.length));
int leftCount = 0;
int rightCount = 0;
for (int i = 0; i < num.length; i++) {
if (num[i] == left) {
leftCount += 1;
}
if (num[i] == right) {
rightCount += 1;
}
}
if (leftCount > rightCount) {
return left;
} else {
return right;
}
}
}
public class MooreVotingSolution {
public int majorityElement(int[] nums) {
int curr = nums[0];
int times = 1;
for (int i = 1; i < nums.length; i++) {
if (nums[i] == curr) {
times += 1;
} else {
times -= 1;
if (times == 0) {
times = 1;
curr = nums[i];
}
}
}
return curr;
}
}