leetcode 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.

class Solution {

/*还是采用了DFS，这种多个元素组成，而每个元素又有多个选择的时候，我认为DFS还是能很好的解决的，对这个问题来说，参数可能有点多，这个问题在编程之美中出现了在P218*/

public:
    vector<string> letterCombinations(string digits) {
        int count[10]={0,0,3,3,3,3,3,4,3,4};
        char letter[10][4]={{},{},{'a','b','c'},{'d','e','f'},{'g','h','i'},{'j','k','l'},{'m','n','o'},
        {'p','q','r','s'},{'t','u','v'},{'w','x','y','z'}};
        int len=digits.length();
        string aresult;
        vector<string> result;
        sub(digits,result,aresult,0,len,count,letter);
        return result;
        
    }
    void sub(string digits,vector<string> &result,string &aresult,int index,int len,int *count,char (*letter)[4]){
        if(index==len) result.push_back(aresult);
        for(int i=0;i<count[digits[index]-'0'];i++){
            aresult.push_back(letter[digits[index]-'0'][i]);
            sub(digits,result,aresult,index+1,len,count,letter);
            aresult.pop_back();
        }
    }

   
};