[LeetCode] Letter Combinations of a Phone Number

class Solution {
public:
    vector<string> map;
    vector<string> ret;
    vector<char> sln;
    
    Solution() {
        map.push_back("");
        map.push_back("");
        map.push_back("abc");
        map.push_back("def");
        map.push_back("ghi");
        map.push_back("jkl");
        map.push_back("mno");
        map.push_back("pqrs");
        map.push_back("tuv");
        map.push_back("wxyz");
    }
    
    void DFS(string digits, int n) {
        if (n == digits.size()) {
            string s = "";
            for (int i = 0; i < sln.size(); i++)
                s += sln[i];
            
            ret.push_back(s);
            return;
        }
        
        int pos = digits[n] - '0';
        
        for (int i = 0; i < map[pos].size(); i++) {
            sln.push_back(map[pos][i]);
            DFS(digits, n + 1);
            sln.pop_back();
        }
    }
    
    vector<string> letterCombinations(string digits) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        ret.clear();
        DFS(digits, 0);
        return ret;
    }
};

Small Case: 8ms

Large Case: 0ms