Formatted question description: https://leetcode.ca/all/1096.html

1096. Brace Expansion II (Hard)

Under a grammar given below, strings can represent a set of lowercase words.  Let's use R(expr) to denote the set of words the expression represents.

Grammar can best be understood through simple examples:

  • Single letters represent a singleton set containing that word.
    • R("a") = {"a"}
    • R("w") = {"w"}
  • When we take a comma delimited list of 2 or more expressions, we take the union of possibilities.
    • R("{a,b,c}") = {"a","b","c"}
    • R("{ {a,b},{b,c} }") = {"a","b","c"} (notice the final set only contains each word at most once)
  • When we concatenate two expressions, we take the set of possible concatenations between two words where the first word comes from the first expression and the second word comes from the second expression.
    • R("{a,b}{c,d}") = {"ac","ad","bc","bd"}
    • R("a{b,c}{d,e}f{g,h}") = {"abdfg", "abdfh", "abefg", "abefh", "acdfg", "acdfh", "acefg", "acefh"}

Formally, the 3 rules for our grammar:

  • For every lowercase letter x, we have R(x) = {x}
  • For expressions e_1, e_2, ... , e_k with k >= 2, we have R({e_1,e_2,...}) = R(e_1) ∪ R(e_2) ∪ ...
  • For expressions e_1 and e_2, we have R(e_1 + e_2) = {a + b for (a, b) in R(e_1) × R(e_2)}, where + denotes concatenation, and × denotes the cartesian product.

Given an expression representing a set of words under the given grammar, return the sorted list of words that the expression represents.

 

Example 1:

Input: "{a,b}{c,{d,e} }"
Output: ["ac","ad","ae","bc","bd","be"]

Example 2:

Input: "{ {a,z},a{b,c},{ab,z} }"
Output: ["a","ab","ac","z"]
Explanation: Each distinct word is written only once in the final answer.

 

Constraints:

  1. 1 <= expression.length <= 60
  2. expression[i] consists of '{', '}', ','or lowercase English letters.
  3. The given expression represents a set of words based on the grammar given in the description.

Related Topics: String

Similar Questions:

Solution 1.

// OJ: https://leetcode.com/problems/brace-expansion-ii/

// Time: O(N^2)
// Space: O(N^2)
class Solution {
    int i = 0, N;
    unordered_set<string> handleList(string &s) {
        ++i; // {
        unordered_set<string> ans;
        while (s[i] != '}') {
            auto st = dfs(s);
            for (auto &a : st)
                ans.insert(a);
            if (s[i] == ',') ++i;
        }
        ++i; // }
        return ans;
    }
    unordered_set<string> dfs(string &s) {
        unordered_set<string> ans{ "" };
        while (i < N && s[i] != ',' && s[i] != '}') {
            unordered_set<string> tmp;
            if (s[i] != '{') {
                string str;
                while (i < N && isalpha(s[i])) str += s[i++];
                for (auto &a : ans) tmp.insert(a + str);
            } else {
                auto st = handleList(s);
                for (auto &a : ans)
                    for (auto &b : st)
                        tmp.insert(a + b);
            }
            swap(tmp, ans);
        }
        return ans;
    }
public:
    vector<string> braceExpansionII(string s) {
        N = s.size();
        auto st = dfs(s);
        vector<string> ans(st.begin(), st.end());
        sort(ans.begin(), ans.end());
        return ans;
    }
};

Solution 2.

// OJ: https://leetcode.com/problems/brace-expansion-ii/

// Time: O(N^2)
// Space: O(N^2)
class Solution {
    int i = 0;
    vector<string> handleList(string &s) {
        ++i; // {
        vector<string> ans;
        while (s[i] != '}') {
            auto st = dfs(s);
            for (auto &a : st)
                ans.push_back(a);
            if (s[i] == ',') ++i;
        }
        ++i; // }
        return ans;
    }
    vector<string> dfs(string &s) {
        vector<string> ans{ "" };
        while (i < s.size() && s[i] != ',' && s[i] != '}') {
            if (s[i] != '{') {
                for (auto &a : ans) a += s[i];
                ++i;
            } else {
                auto list = handleList(s);
                vector<string> tmp;
                for (auto &a : ans)
                    for (auto &b : list)
                        tmp.push_back(a + b);
                swap(tmp, ans);
            }
        }
        return ans;
    }
public:
    vector<string> braceExpansionII(string s) {
        auto st = dfs(s);
        vector<string> ans(st.begin(), st.end());
        sort(ans.begin(), ans.end());
        ans.erase(unique(ans.begin(), ans.end()), ans.end());
        return ans;
    }
};

Java

class Solution {
    public List<String> braceExpansionII(String expression) {
        Queue<String> queue = new LinkedList<String>();
        queue.offer(expression);
        Set<String> set = new HashSet<String>();
        StringBuffer sb = new StringBuffer();
        while (!queue.isEmpty()) {
            String str = queue.poll();
            if (str.indexOf('{') == -1)
                set.add(str);
            else {
                int index = 0;
                int left = 0, right = 0;
                while (str.charAt(index) != '}') {
                    if (str.charAt(index) == '{')
                        left = index;
                    index++;
                }
                right = index;
                String leftStr = str.substring(0, left);
                String rightStr = str.substring(right + 1);
                String[] array = str.substring(left + 1, right).split(",");
                for (String midStr : array) {
                    sb.setLength(0);
                    sb.append(leftStr);
                    sb.append(midStr);
                    sb.append(rightStr);
                    queue.offer(sb.toString());
                }
            }
        }
        List<String> list = new ArrayList<String>(set);
        Collections.sort(list);
        return list;
    }
}

All Problems

All Solutions