全排列核心代码转acm

好人cc

已于 2023-10-12 21:53:34 修改

阅读量227

点赞数

文章标签：算法 c++ 深度优先

于 2023-10-12 21:49:20 首次发布

本文链接：https://blog.csdn.net/weixin_68063596/article/details/133799990

版权

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <sstream>

using namespace std;

class Solution {
public:
    vector<vector<int>> permute(vector<int>& nums) {
        vector<vector<int>> result;
        vector<int> path;
        vector<bool> used(nums.size(), false);
        backtracking(nums, used, path, result);
        return result;
    }

private:
    void backtracking(vector<int>& nums, vector<bool>& used, vector<int>& path, vector<vector<int>>& result) {
        if (path.size() == nums.size()) {
            result.push_back(path);
            return;
        }

        for (int i = 0; i < nums.size(); i++) {
            if (used[i] == true) continue;

            used[i] = true;
            path.push_back(nums[i]);
            backtracking(nums, used, path, result);
            path.pop_back();
            used[i] = false;
        }
    }
};

int main() {
    string input;
    while (getline(cin, input)) {
        vector<int> nums;
        stringstream ss(input);
        int num;

        while (ss >> num) {
            nums.push_back(num);
        }

        Solution solution;
        vector<vector<int>> result = solution.permute(nums);

        for (auto& permutation : result) {
            for (int i = 0; i < permutation.size(); i++) {
                cout << permutation[i];
                if (i != permutation.size() - 1) {
                    cout << " ";
                }
            }
            cout << endl;
        }
    }

    return 0;
}

#include <iostream>
#include <vector>
#include <sstream>

using namespace std;

vector<vector<int>> result;
vector<int> path;

void backtracking(vector<int>& nums, vector<bool>& used) {
    if (path.size() == nums.size()) {
        result.push_back(path);
        return;
    }
    for (int i = 0; i < nums.size(); i++) {
        if (used[i] == true) continue;
        used[i] = true;
        path.push_back(nums[i]);
        backtracking(nums, used);
        path.pop_back();
        used[i] = false;
    }
}

vector<vector<int>> permute(vector<int>& nums) {
    result.clear();
    path.clear();
    vector<bool> used(nums.size(), false);
    backtracking(nums, used);
    return result;
}

int main() {
    string line;
    while (getline(cin, line)) {
        istringstream iss(line);
        vector<int> nums;
        int num;
        while (iss >> num) {
            nums.push_back(num);
        }
        vector<vector<int>> permutations = permute(nums);
        for (int i = 0; i < permutations.size(); i++) {
            cout << "[";
            for (int j = 0; j < permutations[i].size(); j++) {
                cout << permutations[i][j];
                if (j < permutations[i].size() - 1) {
                    cout << " ";
                }
            }
            cout << "]";
            if (i < permutations.size() - 1) {
                cout << " ";
            }
        }
        cout << endl;
    }
    return 0;
}