leetcode 日经贴，Cpp code -Letter Combinations of a Phone Number

bachelorchen

于 2015-04-26 11:52:17 发布

阅读量327

点赞数

分类专栏： leetcode Cpp 算法

本文链接：https://blog.csdn.net/bachelorchen/article/details/45287177

版权

算法同时被 3 个专栏收录

183 篇文章 0 订阅

订阅专栏

leetcode

173 篇文章 0 订阅

订阅专栏

Cpp

152 篇文章 0 订阅

订阅专栏

Letter Combinations of a Phone Number

class Solution {
public:
    void genletters(const string &digits, string cur, int indx, vector<string> &vs, string digit2letters[]) {
        int n = digits.length();
        if (n == indx) {
            if (cur != "")
                vs.push_back(cur);
            return;
        }
        int d = int(digits[indx] - '0');
        for (int i = 0; i < digit2letters[d].length(); ++i) {
            genletters(digits, cur + digit2letters[d][i], indx + 1, vs, digit2letters);
        }
    }
    vector<string> letterCombinations(string digits) {
        string digit2letters[] = {"", "", "abc", "def", "ghi", "jkl", "mno",
                                    "pqrs", "tuv", "wxyz"
                                    };
        vector<string> vs;
        string cur;
        int indx = 0;
        genletters(digits, cur, indx, vs, digit2letters);
        return vs;
    }
};