回溯

       在回溯中，递归调用的一个重要特征是要返回。回溯法是暴力解法的一个主要实现手段。在回溯法中通过剪枝，不用到达所有的叶子节点，从而提升算法的效率。

1.17. Letter Combinations of a Phone Number

Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.

A mapping of digit to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters.

Example:

Input: "23"
Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].

class Solution {
private:
    vector<string> res;
    string digits_;
    const string letterMap[10] = {
        " ",    //0
        "",     //1
        "abc",  //2
        "def",  //3
        "ghi",  //4
        "jkl",  //5
        "mno",  //6
        "pqrs", //7
        "tuv",  //8
        "wxyz"  //9
    };
    void findCombination(int index, const string &s){
        if(index == digits_.size()){
            res.push_back(s);
            return;
        }
        char c = digits_[index];
        assert( c >= '0' && c <= '9' && c != '1');
        string letters = letterMap[c-'0'];
        for(int i = 0; i < letters.size(); i++){
            findCombination(index + 1, s + letters[i]);
        }
        return;
    }

public:
    vector<string> letterCombinations(string digits){
        if(digits == "") return res;
        digits_ = digits;
        findCombination(0, "");
        return res;
    }
};

2.输入一个字符串,按字典序打印出该字符串中字符的所有排列。例如输入字符串abc,则打印出由字符a,b,c所能排列出来的所有字符串abc,acb,bac,bca,cab和cba。

输入描述:

输入一个字符串,长度不超过9(可能有字符重复),字符只包括大小写字母。