用dfs表示1-3的排列组合代码
时间: 2023-05-15 16:07:41 浏览: 57
以下是用DFS表示1-3的排列组合的代码:
#include <iostream>
#include <vector>
using namespace std;
void dfs(vector<int>& nums, vector<int>& path, vector<vector<int>>& res, vector<bool>& used) {
if (path.size() == nums.size()) {
res.push_back(path);
return;
}
for (int i = 0; i < nums.size(); i++) {
if (!used[i]) {
used[i] = true;
path.push_back(nums[i]);
dfs(nums, path, res, used);
path.pop_back();
used[i] = false;
}
}
}
vector<vector<int>> permute(vector<int>& nums) {
vector<vector<int>> res;
vector<int> path;
vector<bool> used(nums.size(), false);
dfs(nums, path, res, used);
return res;
}
int main() {
vector<int> nums = {1, 2, 3};
vector<vector<int>> res = permute(nums);
for (auto& r : res) {
for (auto& n : r) {
cout << n << " ";
}
cout << endl;
}
return 0;
}