DataWhale集训-5.实践递归_xgdy8 最新-CSDN博客

本文链接：https://blog.csdn.net/qq_24313621/article/details/86726868

任务6，实战递归】
实战递归：完成Leetcode上的Letter Combinations of a Phone Number(17)及permutations(46)

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:

完整代码：

class Solution {
public:
    void findCombination(const string& digits, int index, const string& s){
        if(index == digits.size()){
            //保存结果
            res.push_back(s);
            return;
        }
        char c = digits[index]; //获取字符串中的指定位置的数字
        string letters = letterMap[c -'0']; //获取上述数字对应的字母
        for(int i =0; i < letters.size(); i++){ //遍历上述数字对应字母的每种可能性，然后对之后的数字字符串递归上述操作
            findCombination(digits, index + 1, s + letters[i]);
        }

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

46. Permutations

Given a collection of distinct integers, return all possible permutations.

Example:

完整代码：

class Solution {
public:
   vector<vector<int> > permute(vector<int> &num) {
        vector<vector<int> > result;
        permutationrecusive(num,0,result);
        return result;
        
    }
    void permutationrecusive(vector<int> &num,int k, vector<vector<int> >&result)
    {
        if(k == num.size())
        {
            result.push_back(num);
            return ;
        }
        
        for(int i = k;i < num.size();i++)
        {
            swap(num[k],num[i]);
            permutationrecusive(num,k+1,result);
            swap(num[k],num[i]);
        }
    }
};

参考资料：

1. LeetCode 17. 电话号码的字母组合(C++)

2.【LeetCode】46. 全排列结题报告 (C++)