AlgorithmsPractice/MobileNumericKeypad.java at master · jigsaw004/AlgorithmsPractice · GitHub

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
//http://www.geeksforgeeks.org/mobile-numeric-keypad-problem/

importjava.util.*;
importjava.lang.*;
importjava.io.*;

classCodechef
{
publicstaticvoidmain (String[] args) throwsjava.lang.Exception
	{
int[][] memo = newint[11][10];

for(inti = 0; i < memo.length; i++){
Arrays.fill(memo[i], -1);
 }

intn = 5;
intcount = 0;
List<List<Integer>> list = newArrayList<List<Integer>>();
list.add(Arrays.asList(0,8));
list.add(Arrays.asList(1,2,4));
list.add(Arrays.asList(2,1,3,5));
list.add(Arrays.asList(3,2,6));
list.add(Arrays.asList(4,1,5,7));
list.add(Arrays.asList(5,2,4,6,8));
list.add(Arrays.asList(6,3,5,9));
list.add(Arrays.asList(7,4,8));
list.add(Arrays.asList(8,5,7,9,0));
list.add(Arrays.asList(9,6,8));

for(inti = 0; i < 10; i++){
count += solve(n,i,memo,list);
 }

System.out.println(count);
	}

publicstaticintsolve(intn, intdigit, int[][] memo, List<List<Integer>> list){
if(memo[n][digit] != -1) returnmemo[n][digit];

if(n <= 1){
memo[n][digit] = 1;
returnmemo[n][digit];
 }

intcount = 0;
for(Integeri : list.get(digit)){
count += solve(n-1,i,memo,list);
 }

memo[n][digit] = count;
returnmemo[n][digit];

	}
}