字母大小写全排列
给定一个字符串S,通过将字符串S中的每个字母转变大小写,我们可以获得一个新的字符串。返回所有可能得到的字符串集合。
示例:
输入: S = "a1b2"
输出: ["a1b2", "a1B2", "A1b2", "A1B2"]
输入: S = "3z4"
输出: ["3z4", "3Z4"]
输入: S = "12345"
输出: ["12345"]
思路+代码+注释:
public List<String> letterCasePermutation(String S) {
/*
思路:找出所有字符串集合,可以拆成多个阶段每个阶段找一个字符,如果找到的字符是字母那么有大小写两种选择,继续往下找
*/
List<String> res=new ArrayList<>();
List<Character> out=new ArrayList<>();
letterCasePermutation(S,0,res,out);
return res;
}
private void letterCasePermutation(String s,int wei,List<String> strs,List<Character> out)
{
if (wei==s.length())
{
StringBuilder sb=new StringBuilder();
for (Character c:out
) {
sb.append(c);
}
strs.add(sb.toString());
return;
}
char c=s.charAt(wei);
if (c>='A' && c<='Z')
{
out.add(c);
letterCasePermutation(s,wei+1,strs,out);
out.remove(out.size()-1);
out.add(Character.toLowerCase(c));
letterCasePermutation(s,wei+1,strs,out);
out.remove(out.size()-1);
}else if (c>='a' && c<='z'){
out.add(c);
letterCasePermutation(s,wei+1,strs,out);
out.remove(out.size()-1);
out.add(Character.toUpperCase(c));
letterCasePermutation(s,wei+1,strs,out);
out.remove(out.size()-1);
}else {
out.add(c);
letterCasePermutation(s,wei+1,strs,out);
out.remove(out.size()-1);
}
}