[LeetCode] Letter Case Permutation

Given a string S, we can transform every letter individually to be lowercase or uppercase to create another string.  Return a list of all possible strings we could create.

Examples:
Input: S = "a1b2"
Output: ["a1b2", "a1B2", "A1b2", "A1B2"]

Input: S = "3z4"
Output: ["3z4", "3Z4"]

Input: S = "12345"
Output: ["12345"]

Note:

• S will be a string with length at most 12.
• S will consist only of letters or digits.

class Solution {
public:
    vector<string> letterCasePermutation(string S) {
        vector<string> res;
        int idx = 0;
        helper(S, idx, res);
        return res;
    }
    
    void helper(string& s, int idx, vector<string>& res) {
        if (idx == s.size()) {
            res.push_back(s);
            return;
        }
        helper(s, idx + 1, res);
        if (isalpha(s[idx])) {
            s[idx] = islower(s[idx]) ? toupper(s[idx]) : tolower(s[idx]);
            helper(s, idx + 1, res);
        }
    }
};
// 9 ms