LeetCode刷题记录3--电话号码的字母组合

思路

• dfs深度优先搜索

class Solution {
public:   
    vector<string> letterCombinations(string digits) {
        vector<int>res;
        map<int,string>mp;
        vector<string>ans;
        mp[2]="abc";
        mp[3]="def";
        mp[4]="ghi";
        mp[5]="jkl";
        mp[6]="mno";
        mp[7]="pqrs";
        mp[8]="tuv";
        mp[9]="wxyz";
        string s="";
        for(int i=0;i<digits.size();i++){
            res.push_back(digits[i]-'0');
        }
        int n=res.size();
        if(n!=0)dfs(0,n,s,mp,ans,res);
        return ans;
    }
    void dfs(int n,int size,string s,map<int,string>mp,vector<string>&ans,vector<int>res){
        if(n==size){
            ans.push_back(s);
            return;
        }
        for(int i=0;i<mp[res[n]].size();i++){
            s+=mp[res[n]][i];
            dfs(n+1,size,s,mp,ans,res);
            s.pop_back();
        }
    }
};