Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
41 lines (29 loc) · 835 Bytes

File metadata and controls

41 lines (29 loc) · 835 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package Algorithms.recursion;
import java.util.Stack;
public class Factorial {
public static void main(String[] strs) {
System.out.println(factorial(10));
System.out.println(factorialIterator(10));
}
public static int factorialIterator(Integer n) {
int ret = 1;
for (int i = n; i >= 1; i--) {
ret *= i;
}
return ret;
}
public static int factorial(Integer n) {
Stack<Integer> s = new Stack<Integer>();
s.push(n);
int ret = 1;
while (!s.isEmpty()) {
int cur = s.pop();
if (cur == 1) {
break;
}
ret *= cur;
s.push(cur - 1);
}
return ret;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.