网站建哪家好,网站幻灯片尺寸设置,上海制作网站公司网站,给军方做网站套模板行不行思路
和之前的回溯不同的是#xff0c;要遍历完所有的数字#xff0c;并且在单层递归逻辑里需要遍历一整个字符串
代码
class Solution {
public:vectorstring letters {, , abc, def, ghi, …思路
和之前的回溯不同的是要遍历完所有的数字并且在单层递归逻辑里需要遍历一整个字符串
代码
class Solution {
public:vectorstring letters {, , abc, def, ghi, jkl, mno, pqrs, tuv, wxyz};vectorstring result;string path;void backTracking(string dights, int curIndex){if(curIndex dights.size()){result.push_back(path);return;}string letter letters[(char)dights[curIndex] - 0];for(int i 0; i letter.size(); i){path.push_back(letter[i]);backTracking(dights, curIndex1);path.pop_back();}return;}vectorstring letterCombinations(string digits) {if(digits ) return result;backTracking(digits, 0);return result;}
};
