电话号码的字母组合

leetcode 17题：题目自己搜吧，打出来一直发布不成功

示例：
输入：digits = "23"
输出：["ad","ae","af","bd","be","bf","cd","ce","cf"]

输入：digits = ""
输出：[]

输入：digits = "2"
输出：["a","b","c"]

思路：用递归模拟场景

vector<string>res;
vector<string>ch={"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
void helper(string digits,int index,string ans){
    if(index==digits.size()){
        res.push_back(ans);
        return;
    }
    string str=ch[digits[index]-'0'];
    for(int i=0;i<str.size();i++){
        helper(digits,index+1,ans+str[i]);
    }
}
vector<string> letterCombinations(string digits) {
    if(digits.size()==0)return {};
    helper(digits,0,"");
    return res;
}