字母大小写全排列编译实现

#include<iostream>
using namespace std;
#include<vector>
#include<cctype>
#include<string>

void backTracking(vector<string> &res, string S, int i)
{
	if (i == S.size())
	{
		res.push_back(S);
		return;
	}
	if (!isalpha(S[i]))
		backTracking(res, S, i + 1);
	else
	{
		S[i] = tolower(S[i]);
		backTracking(res, S, i + 1);
		S[i] = toupper(S[i]);
		backTracking(res, S, i + 1);
	}
}

vector<string> letterCasePermutation(string S) {
	vector<string> res;
	backTracking(res, S, 0);
	return res;
}



int main()
{
	string s;
	cout << "请输入一个字符串:" << endl;
	cin >> s;
	vector<string> res;
	res=letterCasePermutation(s);
	for (int i = 0; i < res.size(); i++) {
		cout << res[i] <<" ";
	}
	cout << endl;
	return 0;
}