24 lines
938 B
Markdown
24 lines
938 B
Markdown
|
<p>给定一个字符串<code>S</code>，通过将字符串<code>S</code>中的每个字母转变大小写，我们可以获得一个新的字符串。返回所有可能得到的字符串集合。</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
|
||
|
|
<pre><strong>示例：</strong>
|
||
|
|
<strong>输入：</strong>S = "a1b2"
|
||
|
|
<strong>输出：</strong>["a1b2", "a1B2", "A1b2", "A1B2"]
|
||
|
|
|
||
|
|
<strong>输入：</strong>S = "3z4"
|
||
|
|
<strong>输出：</strong>["3z4", "3Z4"]
|
||
|
|
|
||
|
|
<strong>输入：</strong>S = "12345"
|
||
|
|
<strong>输出：</strong>["12345"]
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
|
||
|
|
<p><strong>提示：</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>S</code> 的长度不超过<code>12</code>。</li>
|
||
|
|
<li><code>S</code> 仅由数字和字母组成。</li>
|
||
|
|
</ul>
|
||
|
|
<div><div>Related Topics</div><div><li>位运算</li><li>字符串</li><li>回溯</li></div></div>\n<div><li>👍 282</li><li>👎 0</li></div>
|