算法设计与分析（11）-- Letter Combinations of a Phone Number（难度：Medium）

算法设计与分析（11）

题目：Letter Combinations of a Phone Number

问题描述：Given a digit string, return all possible letter combinations that the number could represent.
A mapping of digit to letters (just like on the telephone buttons) is given below.

Input:Digit string "23"
Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].

Note: Although the above answer is in lexicographical order, your answer could be in any order you want.

算法思路：

这道题目的思路其实非常简单，只是把所有可能的字符串都保存下来，并且题目说明了字符串的顺序是可以任意的。所以这里使用了最简单的方式，使用递归函数把所有的字符串找出来。（其实使用递归方式的效率不高，大家也可以考虑别的方式实现）

实现代码：

#include<iostream>
#include<vector>
#include<string>
using namespace std;

void Com(string &digits, string str, int n, vector<string> &result)
{
    if (n < digits.length())
    {
        switch (digits[n])
        {
        case '2':
        {
            Com(digits, str + 'a', n + 1, result);
            Com(digits, str + 'b', n + 1, result);
            Com(digits, str + 'c', n + 1, result);
            break;
        }
        case '3':
        {
            Com(digits, str + 'd', n + 1, result);
            Com(digits, str + 'e', n + 1, result);
            Com(digits, str + 'f', n + 1, result);
            break;
        }
        case '4':
        {
            Com(digits, str + 'g', n + 1, result);
            Com(digits, str + 'h', n + 1, result);
            Com(digits, str + 'i', n + 1, result);
            break;
        }
        case '5':
        {
            Com(digits, str + 'j', n + 1, result);
            Com(digits, str + 'k', n + 1, result);
            Com(digits, str + 'l', n + 1, result);
            break;
        }
        case '6':
        {
            Com(digits, str + 'm', n + 1, result);
            Com(digits, str + 'n', n + 1, result);
            Com(digits, str + 'o', n + 1, result);
            break;
        }
        case '7':
        {
            Com(digits, str + 'p', n + 1, result);
            Com(digits, str + 'q', n + 1, result);
            Com(digits, str + 'r', n + 1, result);
            Com(digits, str + 's', n + 1, result);
            break;
        }
        case '8':
        {
            Com(digits, str + 't', n + 1, result);
            Com(digits, str + 'u', n + 1, result);
            Com(digits, str + 'v', n + 1, result);
            break;
        }
        case '9':
        {
            Com(digits, str + 'w', n + 1, result);
            Com(digits, str + 'x', n + 1, result);
            Com(digits, str + 'y', n + 1, result);
            Com(digits, str + 'z', n + 1, result);
            break;
        }
        default:
            break;
        }
    }
    else
        result.push_back(str);
}

vector<string> letterCombinations(string digits) 
{
    string str;
    vector<string> result;
    if (digits.empty())
        return result;
    else
    {
        Com(digits, str, 0, result);
        return result;
    }
}

int main()
{
    string digits = "3";
    vector<string> output;
    output = letterCombinations(digits);
    for (int i = 0; i < output.size(); ++i)
        cout << output[i] << endl;
    return 0;
}