在C+++中查找拆分字符串的所有数组排列

#include <iostream>
#include <vector>
#include <string>

using namespace std;

void backtrack(vector<string>& result, string& str, string& temp, int start) {
    if (start == str.length()) {
        result.push_back(temp);
        return;
    }

    for (int i = start; i < str.length(); i++) {
        string substr = str.substr(start, i - start + 1);
        temp += substr + " ";
        backtrack(result, str, temp, i + 1);
        temp.erase(temp.length() - substr.length() - 1);
    }
}

vector<string> splitStringPermutations(string str) {
    vector<string> result;
    string temp;
    backtrack(result, str, temp, 0);
    return result;
}

int main() {
    string input;
    cout << "请输入字符串: ";
    getline(cin, input);

    vector<string> permutations = splitStringPermutations(input);

    cout << "拆分字符串的所有数组排列: " << endl;
    for (const string& permutation : permutations) {
        cout << permutation << endl;
    }

    return 0;
}