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 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87
| #include <iostream> #include <vector> #include <string> using namespace std;
class Solution { public: vector<string> letterCombinations(string digits) { res.clear(); path.clear(); if (digits.empty()) { return res; }
dfs(digits, 0);
return res; }
void dfs(const string& digits, int index) { if (digits.size() == index) { res.push_back(path); return; }
int digit = digits[index] - '0'; string letters = num2str[digit]; for (int i = 0; i < letters.size(); i++) { path.push_back(letters[i]); dfs(digits, index + 1); path.pop_back(); } }
private: string num2str[10] = { "", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz" }; vector<string> res; string path; };
void printArray(const vector<string>& nums) { cout << "["; for (size_t i = 0; i < nums.size(); i++) { cout << "\"" << nums[i] << "\""; if (i != nums.size() - 1) cout << ","; } cout << "]" << endl; }
int main() { Solution solution; vector<string> digits_cases = { "23", "", "2", };
for (int i = 0; i < digits_cases.size(); i++) { string digits = digits_cases[i]; vector<string> result = solution.letterCombinations(digits);
cout << "Input: \"" << digits << "\"\n"; cout << "Output: "; printArray(result); }
return 0; }
|