DFS Letter Combinations of a Phone Number

来源:互联网 发布:查车档案软件 编辑:程序博客网 时间:2024/06/06 01:51

思想:

DFS


class Solution {public:    const vector<string> dict={"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};        void dfs(string digits, int depth, string path, vector<string> &res) {        if(depth == digits.size()) {            res.push_back(path);            return;        }        for(auto c: dict[digits[depth] - '0']) {            dfs(digits, depth+1, path+c, res);        }    }        vector<string> letterCombinations(string digits) {        vector<string> res;        if(digits.size() == 0) return res;        dfs(digits, 0, "", res);        return res;    }};


0 0
原创粉丝点击