# 1096. Brace Expansion II

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.

``````class Solution {
public:
vector<string> braceExpansionII(string expression) {
vector<string> res;
unordered_set<string> visited;
stack<string> stk;
stk.push(expression);
while (!stk.empty()) {
string str = stk.top(); stk.pop();
if (str.find("{") == string::npos) {
if (!visited.count(str)) {
visited.insert(str);
res.push_back(str);
}
continue;
}
int i = 0, left = 0, right = 0;
while (str[i] != '}') {
if (str[i++] == '{') left = i - 1;
}
right = i;
string before = str.substr(0, left);
string after = str.substr(right + 1);
string mid = str.substr(left + 1, right - left - 1);
istringstream iss(mid);
string t;
while (getline(iss, t, ',')) {
stk.push(before + t + after);
}
}
sort(res.begin(), res.end());
return res;
}
};
``````

Github 同步地址:

https://github.com/grandyang/leetcode/issues/1096

Brace Expansion

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

https://leetcode.com/problems/brace-expansion-ii/discuss/348541/JAVA-iter_dfs-36ms

https://leetcode.com/problems/brace-expansion-ii/discuss/317890/Simple-solution-(C%2B%2B)

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation