-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathencodeNumber.java
More file actions
70 lines (56 loc) · 1.49 KB
/
Copy pathencodeNumber.java
File metadata and controls
70 lines (56 loc) · 1.49 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
public class encodeNumber {
public static void main(String[] args) {
int[] a = encodeNumber(6936);
for (int i = 0; i < a.length; i++) {
System.out.print(a[i] + " ");
}
System.out.println(" ");
a = encodeNumber(2);
for (int i = 0; i < a.length; i++) {
System.out.print(a[i] + " ");
}
System.out.println(" ");
a = encodeNumber(6);
for (int i = 0; i < a.length; i++) {
System.out.print(a[i] + " ");
}
System.out.println(" ");
a = encodeNumber(14);
for (int i = 0; i < a.length; i++) {
System.out.print(a[i] + " ");
}
System.out.println(" ");
a = encodeNumber(24);
for (int i = 0; i < a.length; i++) {
System.out.print(a[i] + " ");
}
System.out.println(" ");
a = encodeNumber(1200);
for (int i = 0; i < a.length; i++) {
System.out.print(a[i] + " ");
}
}
public static int[] encodeNumber(int number) {
//int i;
int count = 0;
int n = number;
for (int i = 2; i <= n; i++) {
if (n % i == 0) {
count++;
n /= i;
i--;
}
}
int[] factors = new int[count];
int c = 0;
for (int i = 2; i <= number; i++) {
if (number % i == 0) {
factors[c] = i;
c++;
number /= i;
i--;
}
}
return factors;
}
}