[LeetCode] 784. Letter Case Permutation - 문제풀이
Description 주어진 문자열에서 대소문자를 변경 하여 가능한 순열 목록을 반환하는 문제입니다. Given a string s, you can transform every letter individually to be lowercase or uppercase to create another string. Return a list of all possible strings we could create. Return the output in any order. Example 1: Input: s = "a1b2" Output: ["a1b2","a1B2","A1b2","A1B2"] Example 2: Input: s = "3z4" Output: ["3z4","3Z4"] Constraints: 1
