-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfactorialless.java
54 lines (44 loc) · 1.27 KB
/
factorialless.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
import java.util.ArrayList;
import java.util.List;
// import java.util.ArrayList;
public class factorialless {
public static void main(String[] args) {
System.out.println(factorialNumbers(20));
}
public static List<Integer> factorial(int n) {
List<Integer> factlist = new ArrayList<>();
int fact = 1;
if (n == 1) {
factlist.add(1);
} else {
for (int i = 1; i <= (n / 2); i++) {
fact = fact * i;
if (fact <= n) {
factlist.add(fact);
}
}
}
for (int i = 0; i < factlist.size(); i++) {
System.out.println(factlist.get(i));
}
return factlist;
}
public static ArrayList<Long> factorialNumbers(long n) {
ArrayList<Long> factlist = new ArrayList<>();
long fact = 1L;
if (n == 1) {
factlist.add(n);
} else {
for (int i = 1; i <= (n / 2); i++) {
fact = fact * i;
if (fact <= n) {
factlist.add(fact);
}
}
}
for (int i = 0; i < factlist.size(); i++) {
System.out.println(factlist.get(i));
}
return factlist;
}
}