Created
December 18, 2013 21:56
-
-
Save KorbenC/8030540 to your computer and use it in GitHub Desktop.
given a digit number print all of the possible strings you can make with it using the corresponding letters on the numbers
This file contains hidden or 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 <iostream> | |
| #include <map> | |
| #include <vector> | |
| #include <string> | |
| using namespace std; | |
| void initLetterMap(map<char,string> &lmap); | |
| vector<string> getMapped(const string &phoneNumber, map<char,string> &lmap); | |
| vector<string> getPermutations(vector<string> number); | |
| unsigned long int countPermutations(vector<string> number); | |
| void initLetterMap(map<char,string> &lmap) { | |
| lmap['2'] = "ABC"; | |
| lmap['3'] = "DEF"; | |
| lmap['4'] = "GHI"; | |
| lmap['5'] = "JKL"; | |
| lmap['6'] = "MNO"; | |
| lmap['7'] = "PQRS"; | |
| lmap['8'] = "TUV"; | |
| lmap['9'] = "WXYZ"; | |
| } | |
| unsigned long int countPermutations(vector<string> number) { | |
| long int fold = 1; | |
| int vals = 0; | |
| vector<string>::iterator it; | |
| for (it=number.begin();it!=number.end();it++) { | |
| vals = (*it).length(); | |
| fold *= vals; | |
| } | |
| return fold; | |
| } | |
| vector<string> getMapped(const string &phoneNumber, map<char,string> &lmap) { | |
| unsigned int i; | |
| vector<string> out; | |
| char digit; | |
| string temp; | |
| for (i=0;i<phoneNumber.length();i++) { | |
| digit = phoneNumber.at(i); | |
| if (isdigit(digit)) { | |
| out.push_back(lmap[digit]); | |
| } else { | |
| temp = string(1,digit); | |
| out.push_back(temp); | |
| } | |
| } | |
| return out; | |
| } | |
| vector<string> getPermutations(vector<string> number) { | |
| vector<string> results; | |
| unsigned long int i,j,k; | |
| unsigned long int perms = countPermutations(number); | |
| vector<string>::reverse_iterator numit; | |
| string temp,temp2; | |
| vector<int> state = vector<int>(number.size(), 0); | |
| vector<int>::reverse_iterator stateit; | |
| for (i=0;i<perms;i++) { | |
| j=i; | |
| temp = ""; | |
| for (stateit=state.rbegin(), numit=number.rbegin();stateit!=state.rend();stateit++, numit++) { | |
| *stateit = j % (*numit).length(); | |
| j /= (*numit).length(); | |
| temp.insert(temp.begin(),(*numit)[*stateit]); | |
| } | |
| results.push_back(temp); | |
| } | |
| return results; | |
| } | |
| int main() { | |
| map<char,string> lettermap; | |
| initLetterMap(lettermap); | |
| string input; | |
| cout << "> "; getline(cin,input); | |
| vector<string> perms = getPermutations(getMapped(input,lettermap)); | |
| vector<string>::iterator it; | |
| for (it=perms.begin();it!=perms.end();it++) { | |
| cout << *it << endl; | |
| } | |
| cin.get(); | |
| return 0; | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment