Leetcode 784. Letter Case Permutation

就是枚举出所有情况:

class Solution:
    def letterCasePermutation(self, S):
        permutations = ['']

        for s in S:
            if s.isalpha():
                permutations = [p + letter for p in permutations for letter in
                                [s.lower(), s.upper()]]
            else:
                permutations = [p + s for p in permutations]

也可以使用itertools模块里面的笛卡尔积函数:

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

扫码关注我们

微信号：SRE实战

拒绝背锅 运筹帷幄

×

选择打赏方式：

微信 QQ钱包 支付宝

打赏

打赏

打赏

多少都是心意！谢谢大家！！！