全排列子集的各种写法

#include <string.h>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <algorithm>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

// 全排列

/*
 * 1. 基于交换的回溯
 * 2. 结果不是有有序的
 * 3. 时间复杂度于略小于 3n!
 *
 * */
void permutation(vector<vector<int>>& ans, vector<int>& temp, int pos) {
    if (pos >= temp.size()) {
        ans.push_back(temp);
        return;
    }
    for (int i = pos; i < temp.size(); i++) {
        swap(temp[i], temp[pos]);
        permutation(ans, temp, pos + 1);
        swap(temp[i], temp[pos]);
    }
}

/*  1. 基于选择的回溯
 *  2. 有序
 *  3. 时间复杂度高, n^n
 * */

void pickPermutation(vector<vector<int>>& ans, vector<int>& temp, const vector<int>& data, vector<bool>& used) {
    if (temp.size() >= used.size()) {
        ans.push_back(temp);
        return;
    }
    for (int i = 0; i < used.size(); i++) {
        if (!used[i]) {
            used[i] = true;
            temp.push_back(data[i]);
            pickPermutation(ans, temp, data, used);
            temp.pop_back();
            used[i] = false;
        }
    }
}

// 2. 求子集

/*
 *  data 需要提前排序
 *  有序
 *
 * */
void subset(vector<vector<int>>& ans, vector<int>& temp, const vector<int>& data, int pos) {
    ans.push_back(temp);
    if (pos >= data.size()) {
        return;
    }
    for (int i = pos; i < data.size(); ++i) {
        temp.push_back(data[i]);
        subset(ans, temp, data, i + 1);
        temp.pop_back();
    }
}

void pickSubsetHelper(vector<vector<int>>& ans, const vector<int>& data, int mask) {
    vector<int> temp;
    for (int i = 0; i <= 31; i++) {
        if ((mask >> i) & 0x1) {
            temp.push_back(data[i]);
        }
    }
    ans.push_back(temp);
}

/*
 *  基于选择的
 * */
vector<vector<int>> pickSubset(vector<int>& data) {
    vector<vector<int>> ans;
    sort(data.begin(), data.end());
    for (int i = 0; i < pow(2, data.size()); i++) {
        pickSubsetHelper(ans, data, i);
    }
    return ans;
}

/*
 *  01 选择
 *  无序
 * */
void pickSubset2(vector<vector<int>>& res, vector<int>& temp, const vector<int>& data, int pos) {
    if (pos >= data.size()) {
        res.push_back(temp);
        return;
    }
    // 不选
    pickSubset2(res, temp, data, pos + 1);
    temp.push_back(data[pos]);
    // 选
    pickSubset2(res, temp, data, pos + 1);
    temp.pop_back();
}

int main() {
    vector<int> data{1, 2, 3};
    vector<vector<int>> res;
    vector<int> temp;
    pickSubset2(res, temp, data, 0);
    for (auto& vec : res) {
        for (auto c : vec) {
            cout << c << "\t";
        }
        cout << endl;
    }
}

}