像这种一分为二,类似递归的思路,一般外层循环字符位置,内层循环已有字符串。同https://blog.csdn.net/ShellDawn/article/details/100148798
class Solution {
public:
vector<string> letterCasePermutation(string S) {
vector<string> v;
v.push_back(S);
int N = S.length();
for(int i=0;i<N;i++){
int M = v.size();
for(int j=0;j<M;j++){
if(v[j][i] >= 'a' && v[j][i] <= 'z'){
v.push_back(v[j]);
v[v.size()-1][i] = 'A' + v[j][i] - 'a';
}
if(v[j][i] >= 'A' && v[j][i] <= 'Z'){
v.push_back(v[j]);
v[v.size()-1][i] = 'a' + v[j][i] - 'A';
}
}
}
return v;
}
};