Categorygithub.com/SmartsYoung/LeetCode-in-GoAlgorithms0784.letter-case-permutation
package
0.0.0-20210525112244-a601ee6fe7cf
Repository: https://github.com/smartsyoung/leetcode-in-go.git
Documentation: pkg.go.dev
Overview
Versions
1
Dependencies
0
Dependents
0
Files
40 SLOC

# README

784. Letter Case Permutation

题目

Given a string S, we can transform every letter individually to be lowercase or uppercase to create another string. Return a list of all possible strings we could create.

Examples:

Input: S = "a1b2"
Output: ["a1b2", "a1B2", "A1b2", "A1B2"]

Input: S = "3z4"
Output: ["3z4", "3Z4"]

Input: S = "12345"
Output: ["12345"]

Note:

  1. S will be a string with length at most 12.
  2. S will consist only of letters or digits.

解题思路

见程序注释