784. Letter Case Permutation

leetcode.com/problems/letter-case-permutation/

Letter Case Permutation - LeetCode

class Solution:
    def letterCasePermutation(self, S: str) -> List[str]:
        
        output = [""]
        
        for i in range(len(S)) :
            
            curr = []
            
            for j in range(len(output)) :
                if S[i].isalpha() :
                    curr.append(output[j]+S[i].lower())
                    curr.append(output[j]+S[i].upper())
                else :
                    curr.append(output[j]+S[i])
                    
            output = curr
        
        return output
    

 

정리 :

항상 iterative한 방법으로 접근.