Created
August 9, 2014 13:46
-
-
Save vinay13/900a2f4dd2d755a5adc6 to your computer and use it in GitHub Desktop.
keypad character corressponding number
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
#include <string.h> | |
// hashTable[i] stores all characters that correspond to digit i in phone | |
const char hashTable[10][5] = {"", "", "abc", "def", "ghi", "jkl", | |
"mno", "pqrs", "tuv", "wxyz"}; | |
// A recursive function to print all possible words that can be obtained | |
// by input number[] of size n. The output words are one by one stored | |
// in output[] | |
void printWordsUtil(int number[], int curr_digit, char output[], int n) | |
{ | |
// Base case, if current output word is prepared | |
int i; | |
if (curr_digit == n) | |
{ | |
printf("%s ", output); | |
return ; | |
} | |
// Try all 3 possible characters for current digir in number[] | |
// and recur for remaining digits | |
for (i=0; i<strlen(hashTable[number[curr_digit]]); i++) | |
{ | |
output[curr_digit] = hashTable[number[curr_digit]][i]; | |
printWordsUtil(number, curr_digit+1, output, n); | |
if (number[curr_digit] == 0 || number[curr_digit] == 1) | |
return; | |
} | |
} | |
// A wrapper over printWordsUtil(). It creates an output array and | |
// calls printWordsUtil() | |
void printWords(int number[], int n) | |
{ | |
char result[n+1]; | |
result[n] ='\0'; | |
printWordsUtil(number, 0, result, n); | |
} | |
//Driver program | |
int main(void) | |
{ | |
int number[] = {2, 3, 4}; | |
int n = sizeof(number)/sizeof(number[0]); | |
printWords(number, n); | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment