[Swift]LeetCode1087. 字母切换 | Permutation of Letters
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★ A string? 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,? For example,c}d{e,f}"?represents the list? 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: 输入:"{a,e}f" 输出:["acdf","bcef"] 示例 2: 输入:"abcd" 输出:["abcd"]? 提示:
(编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |