题目
给定一个字符串S,通过将字符串S中的每个字母转变大小写,我们可以获得一个新的字符串。返回所有可能得到的字符串集合。
示例
输入:S = “a1b2”
输出:[“a1b2”, “a1B2”, “A1b2”, “A1B2”]
输入:S = “3z4”
输出:[“3z4”, “3Z4”]
输入:S = “12345”
输出:[“12345”]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/letter-case-permutation
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
方法1:回溯
Java实现
class Solution {
List<String> res = new ArrayList<>();
public List<String> letterCasePermutation(String s) {
StringBuffer track = new StringBuffer();
backtrack(s, 0, track);
return res;
}
public void backtrack(String s, int start, StringBuffer track){
//触发结束条件
if (track.length() == s.length()){
res.add(new String(track));
return;
}
for (int i = start; i < s.length(); i++){
//如果是数字则直接加在后面
if (Character.isDigit(s.charAt(i))){
//做选择
track.append(s.charAt(i));
//到下一层决策树
backtrack(s, i + 1, track);
//取消选择
track.deleteCharAt(track.length() - 1);
}else{ //是字母的话,2种情况
char upper = Character.toUpperCase(s.charAt(i));
track.append(upper);
backtrack(s, i + 1, track);
track.deleteCharAt(track.length() - 1);
char lower = Character.toLowerCase(s.charAt(i));
track.append((lower));
backtrack(s, i + 1, track);
track.deleteCharAt(track.length() - 1);
}
}
}
}