leetcode: Letter Combinations of a Phone Number

来源:互联网 发布:淘宝背景 编辑:程序博客网 时间:2024/06/06 04:39

还是回溯

class Solution {public:    vector<string> letterCombinations(string digits) {        if(digits == "")            return vector<string>(1,"");        vector< string> res;        core( digits, res, "", 0);        return res;    }    void core( const string &digits, vector< string> &res, string str, int pos){        if( pos == digits.size()){            res.push_back(str);            return;        }        const static string letter[10] = {"","","abc","def","ghi","jkl","mno","qprs","tuv","wxyz"};        for( int i = 0; i < letter[digits[pos]-'0'].size(); ++i){            core( digits, res, str+letter[digits[pos]-'0'][i], pos+1);        }    }};


0 0
原创粉丝点击