代码随想录 | 回溯1

77.组合

class Solution {
public:
    void track(vector<vector<int>>& result,vector<int>& path,int n,int k,int a)
    {
        if(path.size()==k)
        {
            result.push_back(path);
            return;
        }

        for(int i=a;i<=n;i++)
        {
            path.push_back(i);
            track(result,path,n,k,i+1);
            path.pop_back();
        }
    }
    vector<vector<int>> combine(int n, int k) {
        vector<vector<int>> result;
        vector<int> path;
        track(result,path,n,k,1);
        return result;
    }
};

216. 组合Ⅲ

class Solution {
public:
    vector<vector<int>> result;
    vector<int> path;
    void track(int k,int n,int a,int sum)
    {
        if(sum > n)
        {
            return;
        }

        if(path.size()==k)
        {
            if(sum==n)
            {
                result.push_back(path);
            }
            return;
        }

        for(int i = a;i<= 9 - (k - path.size()) + 1;i++)
        {
            path.push_back(i);
            sum+=i;
            track(k,n,i+1,sum);
            sum-=i;
            path.pop_back();
        }
    }
    vector<vector<int>> combinationSum3(int k, int n) {
        track(k,n,1,0);
        return result;
    }
};

17.电话号码的字母组合

class Solution {
public:
    vector<string> letterCombinations(string digits) {
        unordered_map <int,string> umap;
        umap[2] = "abc";
        umap[3] = "def";
        umap[4] = "ghi";
        umap[5] = "jkl";
        umap[6] = "mno";
        umap[7] = "pqrs";
        umap[8] = "tuv";
        umap[9] = "wxyz";

        vector<string> result;
        string res;

         if (digits.size() == 0) {
            return result;
        }

        back(result,umap,digits,0,res);
        return result;
    }

    void back(vector<string>& result, unordered_map<int,string>& umap,string digits,int index,string res)
    {
        if(index == digits.length())
        {
            result.push_back(res);
            return;
        }

        int digit = digits[index] - '0';  
        string s = umap[digit];
        for(int i=0;i<s.length();i++)
        {
            res.push_back(s[i]);
            back(result, umap, digits, index+1,res);
            res.pop_back();
        }
    }
};