【leetcode】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:

• S will be a string with length between 1 and 12.
• S will consist only of letters or digits.

题解如下：

class Solution {
    public List<String> letterCasePermutation(String S) {
        List<String> res = new ArrayList<>();
        if(S == null)
            return res;
        char[] arr = S.toCharArray();
        dfs(res,arr,0);
        return res;
    }
    
    public void dfs(List<String> res,char[] arr,int idx) {
        if(idx == arr.length) {
            res.add(new String(arr));
            return;
        }
        if(arr[idx] >= '0' && arr[idx] <= '9') {
            dfs(res,arr,idx+1);
            return;
        }
        
        arr[idx] = Character.toUpperCase(arr[idx]);
        dfs(res,arr,idx+1);
        
        arr[idx] = Character.toLowerCase(arr[idx]);
        dfs(res,arr,idx+1);
    }
}