Leetcode 784. Letter Case Permutation 字母大小写全排列

Leetcode 784. 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.

Note:

S will be a string with length between 1 and 12.
S will consist only of letters or digits.

示例:

Examples:

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

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

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

解答

这道题很明显是递归思路，每遇到一个字符，就递归处理字符串。

当遇到一个字符，可以选择不处理，也可以选择将这个字符转变大小写。

代码

class Solution {

public:
    vector<string> letterCasePermutation(string S) {
        vector<string> res;
        process(S, 0, res);
        return res;
    }

    void process(string &s, int i, vector<string> &res) {
        if (i == s.size()) {
            res.push_back(s);
            return;
        }
        process(s, i + 1, res);
        if (isupper(s[i])) {
            s[i] = s[i] + 32;
            process(s, i + 1, res);
        } else if (islower(s[i])) {
            s[i] = s[i] - 32;
            process(s, i + 1, res);
        }

        
    }
};