java.lang.Object
g0701_0800.s0784_letter_case_permutation.Solution

public class Solution extends Object
784 - Letter Case Permutation.<p>Medium</p> <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><strong>Example 1:</strong></p> <p><strong>Input:</strong> s = &ldquo;a1b2&rdquo;</p> <p><strong>Output:</strong> [&ldquo;a1b2&rdquo;,&ldquo;a1B2&rdquo;,&ldquo;A1b2&rdquo;,&ldquo;A1B2&rdquo;]</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> s = &ldquo;3z4&rdquo;</p> <p><strong>Output:</strong> [&ldquo;3z4&rdquo;,&ldquo;3Z4&rdquo;]</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>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • letterCasePermutation

      public List<String> letterCasePermutation(String s)
    • helper

      public void helper(String s, int curr, String temp)