forked from Silver-Taurus/algorithms_and_data_structures
-
Notifications
You must be signed in to change notification settings - Fork 0
/
phone_digits.cpp
67 lines (62 loc) · 2.09 KB
/
phone_digits.cpp
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
59
60
61
62
63
64
65
66
67
/**
* Given a normal keypad.
* _________________________
* | 1 | 2 | 3 |
* | | abc | def |
* _________________________
* | 4 | 5 | 6 |
* | ghi | jkl | mno |
* ________________________
* | 7 | 8 | 9 |
* | pqrs | tuv | wxyz |
* _________________________
*
* and a n digit number, list all the words which are possible by pressing these n digits.
* example
* 234 - adg adh adi aeg aeh aei afg afh afi bdg bdh bdi beg beh bei bfg bfh bfi
* cdg cdh cdi ceg ceh cei cfg cfh cfi
*/
#include <iostream>
#include <string>
#include <unordered_map>
#include <sstream>
#include <vector>
std::unordered_map<char, std::string> table{ { '0', "" },
{ '1', "" },
{ '2', "abc"},
{ '3', "def"},
{ '4', "ghi"},
{ '5', "jkl"},
{ '6', "mno"},
{ '7', "pqrs"},
{ '8', "tuv"},
{ '9', "wxyz"} };
void get_words( std::string input, unsigned int curr_digit,
std::string & curr_str, std::vector<std::string> & output)
{
if ( curr_digit == input.size()) {
output.push_back(curr_str);
return;
}
std::string curr_alphas{ table[input[curr_digit]] };
for( unsigned int i = 0; i < curr_alphas.size(); ++i ) {
curr_str[curr_digit] = curr_alphas[i];
get_words( input, curr_digit + 1, curr_str, output);
if (curr_alphas[i] == '0' || curr_alphas[i] == '1') {
return;
}
}
}
int main()
{
std::string input;
std::cout << "Enter a number:";
std::cin >> input;
std::vector<std::string> output;
std::string curr_string(input.size(), ' ');
get_words(input, 0, curr_string, output);
for ( auto & word : output ) {
std::cout << word << std::endl;
}
return 0;
}