-
Notifications
You must be signed in to change notification settings - Fork 0
/
Mode.java
127 lines (110 loc) · 2.22 KB
/
Mode.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
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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
import java.io.*;
import java.util.*;
public class Mode {
/*------------ Instance Variables -------------*/
int[] a;
Random r;
/*------------ Constructors -------------*/
public Mode() {
this(20,100);
}
public Mode(int n) {
this(n,100);
}
/*
n - size of the array
m - max value for each entry
*/
public Mode(int n,int m){
r = new Random();
a = new int[n];
for (int i=0;i<n;i++){
a[i] = r.nextInt(m);
}
}
/*------------ methods -------------*/
public String toString() {
String s = "";
for (int i=0;i<a.length;i++)
s = s + a[i]+", ";
return s;
}
public int maxVal() {
int maxSoFar = a[0];
for (int i = 0; i < a.length;i++) {
if (a[i] > maxSoFar) {
maxSoFar = a[i];
}
}
return maxSoFar;
}
public int maxVal2(int[] nums) {
int maxSoFar = nums[0];
for (int i = 0; i < nums.length;i++) {
if (nums[i] > maxSoFar) {
maxSoFar = nums[i];
}
}
return maxSoFar;
}
public int find(int n){
int ans = -1;
for (int i = 0; i < a.length && ans == -1; i++) {
if (a[i] == n){
ans = i;
break;
//Gets out of loop instantly.
}
}
return ans;
}
public int freq(int n) {
int count = 0;
for (int i=0;i<a.length;i++){
if (a[i]==n)
count = count + 1;
}
return count;
}
public int mode(){
int count = 0;
int modeIndex = 0;
for (int i=0;i<a.length;i++){
if (freq(a[i]) > count){
count = freq(a[i]);
modeIndex = i;
}
}
System.out.println("modeval = "+a[modeIndex]);
return count;
}
//use maxVal()
public int fastmode(){
int max = maxVal();
int[] ans = new int[max + 1];
for (int i = 0;i < a.length;i++) {
ans[a[i]]+=1;
}
//for (int i = 1;i < ans.length-1;i++) {
// if (ans[i + 1] > ans[i]) {
// mode = i + 1;
// }
//}
return find(maxVal2(ans));
}
/*------------ main -------------*/
public static void main(String[] args) {
int n=20,
maxval=20;
if (args.length > 0){
n = Integer.parseInt(args[0]);
}
if (args.length > 1){
maxval = Integer.parseInt(args[1]);
}
Mode m = new Mode(n,maxval);
System.out.println(m);
//System.out.println("modecount = "+m.mode());
System.out.println(m.fastmode());
}
}