給定一個字符串S，通過將字符串S中的每個字母轉變大小寫，我們可以獲得一個新的字符串。返回所有可能得到的字符串集合。

示例:
輸入: S = “a1b2”
輸出: [“a1b2”, “a1B2”, “A1b2”, “A1B2”]

輸入: S = “3z4”
輸出: [“3z4”, “3Z4”]

輸入: S = “12345”
輸出: [“12345”]

代碼

class Solution {List<String> res=new ArrayList<>();public List<String> letterCasePermutation(String S) {StringBuilder stringBuilder=new StringBuilder();letter(stringBuilder,0,S);return res;}public void letter(StringBuilder stringBuilder,int loc,String s) {if(loc==s.length()) {res.add(stringBuilder.toString());return;}//到達邊界if(Character.isDigit(s.charAt(loc))){//數字不能改變stringBuilder.append(s.charAt(loc));letter(stringBuilder, loc+1, s);stringBuilder.deleteCharAt(loc);} else {stringBuilder.append(s.charAt(loc));//沒有翻轉letter(stringBuilder, loc+1, s);stringBuilder.deleteCharAt(loc);//回溯stringBuilder.append(tan(s.charAt(loc)));//翻轉letter(stringBuilder, loc+1, s);stringBuilder.deleteCharAt(loc);}}public char tan(char c) {if(c>='a'&&c<='z')return (char)(c-32);else if(c>='A'&&c<='Z')return (char)(c+32);return c;}
}