class Solution {
public:
vector<string> ans;
vector<string> letterCasePermutation(string S) {
dfs(S, 0);
return ans;
}
void dfs(string s, int n) {
if (n == s.size()) {
ans.push_back(s);
return;
}
dfs(s, n+1);
if (s[n] >= 'A' && s[n] <= 'Z' ||
s[n] >= 'a' && s[n] <= 'z') {
s[n] ^= 32;
dfs(s, n+1);
}
}
};
leetcode784 Letter Case Permutation
最新推荐文章于 2021-11-05 21:08:41 发布