Letter Case Permutation

最新推荐文章于 2021-02-06 15:14:58 发布

Goofiness

最新推荐文章于 2021-02-06 15:14:58 发布

阅读量200

点赞数

分类专栏： leetcode 文章标签： python leetcode

本文链接：https://blog.csdn.net/byr_wy/article/details/88336756

版权

leetcode 专栏收录该内容

232 篇文章 0 订阅

订阅专栏

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.

Example

Examples:
Input: S = “a1b2”
Output: [“a1b2”, “a1B2”, “A1b2”, “A1B2”]

Solution

class Solution:
    def letterCasePermutation(self, S: str) -> List[str]:
        alpha = [[i.upper(), i.lower()] if i.isalpha() else i for i in S]
        return [''.join(i) for i in itertools.product(*alpha)]