store/works/solutions/leetcode/cpp/17.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56

#include <string>
#include <vector>

using std::string;
using std::vector;

vector<char> c_map[9]{
    {'a', 'b', 'c'},
    {'d', 'e', 'f'},
    {'g', 'h', 'i'},
    {'j', 'k', 'l'},
    {'m', 'n', 'o'},
    {'p', 'q', 'r', 's'},
    {'t', 'u', 'v'},
    {'w', 'x', 'y', 'z'}};

void combine(const string::const_iterator &current, const string::const_iterator &end, string &head, vector<string> &result)
{
    const auto &chars = c_map[(*current) - '2'];

    if (current == end)
    {
        for (auto c : chars)
        {
            head.push_back(c);
            result.push_back(head);
            head.pop_back();
        }
        return;
    }

    for (auto c : chars)
    {
        head.push_back(c);
        combine(current + 1, end, head, result);
        head.pop_back();
    }
}

class Solution
{
public:
    vector<string> letterCombinations(string digits)
    {
        std::vector<string> result;

        if (digits.empty())
            return result;

        std::string head;

        combine(digits.cbegin(), digits.cend() - 1, head, result);

        return result;
    }
};