numberofpaths

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
import java.io.*;
import java.util.*;
class {
static int numOfPathsToDest(int n) {
if(n <=1){
return n;
}
int[][] paths = new int[n][n];
for(int i = 0; i< n; i++){
paths[0][i] = 1;
}
for(int i = 1; i< n; i++){
for(int j = i; j < n; j++){
paths[i][j] = paths[i][j-1] + paths[i-1][j];
}
}
return paths[n-1][n-1];
}
public static void main(String[] args) {
System.out.println(numOfPathsToDest(5));
}
}