LeetCode 1087. Brace Expansion

原题链接在这里：https://leetcode.com/problems/brace-expansion/

题目：

A string S represents a list of words.

Each letter in the word has 1 or more options.  If there is one option, the letter is represented as is.  If there is more than one option, then curly braces delimit the options.  For example, "{a,b,c}" represents options ["a", "b", "c"].

For example, "{a,b,c}d{e,f}" represents the list ["ade", "adf", "bde", "bdf", "cde", "cdf"].

Return all words that can be formed in this manner, in lexicographical order.

Example 1:

Input: "{a,b}c{d,e}f"
Output: ["acdf","acef","bcdf","bcef"]

Example 2:

Input: "abcd"
Output: ["abcd"]

Note:

1. 1 <= S.length <= 50
2. There are no nested curly brackets.
3. All characters inside a pair of consecutive opening and ending curly brackets are different.

题解：

If there is curly braces, all the chars in it could be candidate.

Starting from index 0. Do DFS, DFS state needs orginal string, current index, current StringBuilder and res collection.

If current index i points to '{', then find next index j points to '}', for each of candidate inside brances, append it to StringBuilder and continue DFS at index j+1. After DFS, do backtracking.

If current index i points to char, append it to StringBuilder and continue DFS at index i+1. After DFS, do bracktracking.

When current index points to the end of string, add copy of StringBuilder to res collection.

Time Complexity: exponential.

Space: O(n). n = S.length(). stack space.

AC Java:

class Solution {
    public String[] expand(String S) {
        if(S == null || S.length() == 0){
            return new String[0];
        }
        
        List<String> res = new ArrayList<String>();
        dfs(S, 0, new StringBuilder(), res);
        Collections.sort(res);
        return res.toArray(new String[0]);
    }
    
    private void dfs(String s, int i, StringBuilder sb, List<String> res){
        if(i >= s.length()){
            res.add(sb.toString());
            return;
        }
        
        
        if(s.charAt(i) == '{'){
            int j = i+1;
            while(j<s.length() && s.charAt(j)!='}'){
                j++;
            }
            
            String [] candidates = s.substring(i+1, j).split(",");
            for(String candidate : candidates){
                sb.append(candidate);
                dfs(s, j+1, sb, res);
                sb.deleteCharAt(sb.length()-1);
            }
        }else{
            sb.append(s.charAt(i));
            dfs(s, i+1, sb, res);
            sb.deleteCharAt(sb.length()-1);
        }
    }
}

AC Python:

class Solution:
    def expand(self, s: str) -> List[str]:
        res = []
        if not s or len(s) == 0:
            return res
        
        self.dfs(s, 0, "", res)
        return sorted(res)
    
    def dfs(self, s, ind, item, res):
        if ind == len(s):
            res.append(item)
            return
        
        if s[ind] == "{":
            j = ind + 1
            while j < len(s) and s[j] != "}":
                j += 1
            
            cans = s[ind + 1: j].split(",")
            for can in cans:
                self.dfs(s, j + 1, item + can, res)
        else:
            self.dfs(s, ind + 1, item + s[ind], res)

类似Decode String.