Letter Combinations of a Phone Number

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

穴工

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

阅读量265

点赞数

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

本文链接：https://blog.csdn.net/jiongmumu/article/details/9818841

版权

leetcode 专栏收录该内容

53 篇文章 0 订阅

订阅专栏

又是坑爹简单的题目==

递归调用。。

class Solution {
public:

    vector<string> result;
    
    void genSub(string &prev,string &digits,int l,vector<string> &dic)
    {
        if(l>digits.length()) return ;
        if(l==digits.length()-1)
        {
            char c=digits[l];
            int dic_idx=c-'2';
            if(dic_idx<0 || dic_idx>=dic.size())
            result.push_back(prev);
            else
            {
                for(int i=0;i<dic[dic_idx].length();i++)
                {
                    result.push_back(prev+dic[dic_idx][i]);
                }
            }
        }
        else
        {
            char c=digits[l];
            int dic_idx=c-'2';
            if(dic_idx<0 || dic_idx>=dic.size())
            genSub(prev,digits,l+1,dic);
            else
            {
                for(int i=0;i<dic[dic_idx].size();i++)
                {
                   string n_prev= prev+dic[dic_idx][i];
                    genSub(n_prev,digits,l+1,dic);
                }
            }
            
        }
        
    }
    vector<string> letterCombinations(string digits) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<string> dic;
        dic.push_back("abc");
        dic.push_back("def");
        dic.push_back("ghi");
        dic.push_back("jkl");
        dic.push_back("mno");
        dic.push_back("pqrs");
        dic.push_back("tuv");
        dic.push_back("wxyz");
        
        result.clear();
        if(digits.size()<=0)
        {
            result.push_back("");
            return result;
        }
        
        string stmp="";
        genSub(stmp,digits,0,dic);
        
        return result;
    }
};