-
Notifications
You must be signed in to change notification settings - Fork 0
/
getStairsPath.java
42 lines (35 loc) · 1.04 KB
/
getStairsPath.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
package Hard;
import java.util.ArrayList;
import java.util.Scanner;
public class getStairsPath {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
ArrayList<String> list = getStairsRoute(n);
System.out.println(list);
}
private static ArrayList<String> getStairsRoute(int n) {
if(n==0){
ArrayList<String> baseCase = new ArrayList<>();
baseCase.add("");
return baseCase;
}
else if(n<0){
return new ArrayList<>();
}
ArrayList<String> res1 = getStairsRoute(n-1);
ArrayList<String> res2 = getStairsRoute(n-2);
ArrayList<String> res3 = getStairsRoute(n-3);
ArrayList<String> result = new ArrayList<>();
for (String e: res1) {
result.add(e+ "1");
}
for (String e: res2) {
result.add(e+ "2");
}
for (String e: res3) {
result.add(e+ "3");
}
return result;
}
}