mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
27 lines
868 B
HTML
27 lines
868 B
HTML
<p>Given a string <code>s</code>, you can transform every letter individually to be lowercase or uppercase to create another string.</p>
|
|
|
|
<p>Return <em>a list of all possible strings we could create</em>. Return the output in <strong>any order</strong>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "a1b2"
|
|
<strong>Output:</strong> ["a1b2","a1B2","A1b2","A1B2"]
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "3z4"
|
|
<strong>Output:</strong> ["3z4","3Z4"]
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= s.length <= 12</code></li>
|
|
<li><code>s</code> consists of lowercase English letters, uppercase English letters, and digits.</li>
|
|
</ul>
|