-
Notifications
You must be signed in to change notification settings - Fork 0
/
Q229_MajorityElement2.cs
57 lines (51 loc) · 1.59 KB
/
Q229_MajorityElement2.cs
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
public class Solution {
public IList<int> MajorityElement(int[] nums) {
int length = nums.Length;
int[] candidates = new int[2];
int[] counts = new int[2];
FindCandidates(nums, candidates, counts);
IList<int> result = new List<int>();
if (counts[0] > length / 3){
result.Add(candidates[0]);
}
if (counts[1] > length / 3){
result.Add(candidates[1]);
}
return result;
}
private void FindCandidates(int[] nums, int[] candidates, int[] counts){
for (int i = 0; i < nums.Length; i++) {
if (nums[i] == candidates[0]){
counts[0]++;
}
else if (nums[i] == candidates[1]){
counts[1]++;
}
else if (counts[0] == 0){
candidates[0] = nums[i];
counts[0] = 1;
}
else if (counts[1] == 0){
candidates[1] = nums[i];
counts[1] = 1;
}
else{
counts[0]--;
counts[1]--;
}
}
CountCandidatesElement(nums, candidates, counts);
}
private void CountCandidatesElement(int[] nums, int[] candidates, int[] counts){
counts[0] = 0;
counts[1] = 0;
for (int i = 0; i < nums.Length; i++) {
if (nums[i] == candidates[0]){
counts[0]++;
}
else if (nums[i] == candidates[1]){
counts[1]++;
}
}
}
}