Java-Practice-Codes/keypadCombinations.java at master · cyberboysumanjay/Java-Practice-Codes · 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
56
57
58
public class solution {
    public static String[] keypad(int n){
        if (n==0){
              String ans[]=new String[1];
		    ans[0]="";
		    return ans;
        }
        else{
    		int digit=n%10;
    		String subString=contains(digit);
    		String out[]=combination(subString);
    		keypad(n/10);
    		return out;
    	}

    }
	public static String[] combination(String input){
// 		if(input.length()==0){
// 		    String ans[]=new String[1];
// 		    ans[0]="";
// 		    return ans;
// 		}
	//	String smallAns[]=combination(input.substring(1));
		String output[]=new String[2];
        for (int i=0;i<1;i++){
	    	for(int j=0;j<1;j++){
		    output[i]=input.charAt(i)+input.charAt[j];
		}
		return output;
	}


	public static String contains(int digit){

		String elements;
		switch (digit) {
		case 2:  elements = "abc";
		return elements;
		case 3:  elements = "def";
		return elements;
		case 4:  elements = "ghi";
		return elements;
		case 5:  elements = "jkl";
		return elements;
		case 6:  elements = "mno";
		return elements;
		case 7:  elements = "pqrs";
		return elements;
		case 8:  elements = "tuv";
		return elements;
		case 9:  elements = "wxyz";
		return elements;
		default:
			return "";

		}
	}
}