Repository navigation
Expand file tree
/
Copy pathMostOccuring.java
More file actions
168 lines (89 loc) · 2.76 KB
/
Copy pathMostOccuring.java
File metadata and controls
168 lines (89 loc) · 2.76 KB
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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
// initialize your array
// create a for loop to loop through the array
//
// public class MostOccuring{
// public static void main(String[] args) {
// int count = 0;
// int[] arr = {1,2,3,4,5,1,2,6,2,8,2,5};
// for (int i = 0; i < arr.length; i++) {
// boolean evented = false;
// for (int j = 0; j < arr.length; j++) {
// if (arr[i] == arr[j]) {
// evented = true;
// }
// count++;
// for (int k = 0; k < arr.length; k++) {
// }
// }
// System.out.println(count);
// }
// }
// }
// public class MostOccuring {
// public static void main(String[] args) {
// int[] arr = {1,2,3,4,5,1,2,6,2,8,2,5};
// int maxCount = 0;
// int mostOccuring = arr[0];
// for (int i = 0; i < arr.length; i++) {
// int count = 0;
// for (int j = 0; j < arr.length; j++) {
// if (arr[i] == arr[j]) {
// count++;
// }
// }
// if (count > maxCount) {
// maxCount = count;
// mostOccuring = arr[i];
// }
// }
// System.out.println("Most occurring number: " + mostOccuring);
// System.out.println("Frequency: " + maxCount);
// }
// }
// public class MostOccuring {
// public static void main(String[] args) {
// int[] arr = {1,2,3,4,5,1,2,6,2,8,2,5};
// mostOccuring = 0;
// maxOccuring = 0;
// for (int i = 0; i < arr.length; i++) {
// int count = 0;
// for (int j = 0; j < arr.length; j++) {
// if (arr[i] == arr[j]) {
// count++;
// }
// }
// if (count > maxOccuring) {
// maxOccuring = count;
// mostOccuring = arr[i];
// }
// }
// System.out.println(mostOccuring);
// System.out.println(maxOccuring);
// }
// }
// public class Stick{
// public static void main(String[] args) {
// int[] arr = {1,1,2,1,5,2,5,3,6};
// int maxOccuring = 0;
// int mostOccuring = 0;
// for (int i = 0; i < arr.length; i++) {
// int count = 0;
// for (int j = 0; j < arr.length; j++) {
// if (arr[i] == arr[j]) {
// count++;
// }
// }
// if ( count > maxOccuring) {
// maxOccuring = count;
// mostOccuring = arr[i];
// }
// }
// System.out.println(mostOccuring);
// System.out.println(maxOccuring);
// }
// }
public class MostOccuring{
public static void main(String[] args) {
System.out.println("Hello world");
}
}