leetcode 17 Letter Combinations of a Phone Number

最新推荐文章于 2020-10-13 06:37:16 发布

朝气

最新推荐文章于 2020-10-13 06:37:16 发布

阅读量203

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/galaxy_wolf/article/details/51126578

版权

leetcode 专栏收录该内容

64 篇文章 0 订阅

订阅专栏

问题

https://leetcode.com/problems/letter-combinations-of-a-phone-number/

解法

回溯法，递归

class Solution {
public:
    void lc(vector<string>& ret, char* s, int sCnt, const char* digits, int depth)
    {
        if (digits[depth] == 0)
        {
            if (sCnt== 0)
                return;
            s[sCnt] = 0;
            string now(s);
            ret.push_back(now);
            return;
        }

        if (digits[depth] < '2')
        {
            lc(ret, s, sCnt, digits, depth+1);
            return;
        }

        char start, end;

        switch(digits[depth])
        {
            case '7':
                start = 'p';
                end = 't';
                break;
            case '8':
                start = 't';
                end = 'w';
                break;
            case '9':
                start = 'w';
                end = 'z'+1;
                break;
            default:
                start = (digits[depth]-'2') * 3+ 'a';
                end = start +3;
                break;
        }

        for (char c = start; c<end; c++)
        {
            s[sCnt] = c;
            lc(ret, s, sCnt+1, digits, depth+1);
        }
    }
    vector<string> letterCombinations(string digits) {
        char s[digits.size()+1];
        vector<string> ret;
        lc(ret, s, 0, digits.c_str(), 0);
        return ret;
    }
};