回溯--全排列问题

最新推荐文章于 2024-10-01 04:50:10 发布

吴盐煮_

最新推荐文章于 2024-10-01 04:50:10 发布

阅读量138

点赞数 1

文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/m0_68224121/article/details/141529483

版权

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

vector<vector<int>> result;//结果集
vector<int> path;//一条记录
void backtracing(vector<int>& nums, vector<bool>& visited)
{
	if (path.size() == nums.size())
	{
		result.push_back(path);
		return;
	}
	for (int i = 0; i < nums.size(); ++i)
	{
		if (!visited[i])
		{
			path.push_back(nums[i]);
			visited[i] = true;
			backtracing(nums, visited);
			path.pop_back();
			visited[i] = false;
		}
	}
}
void permute(vector<int>& nums)
{
	if (nums.empty())
	{
		return;
	}
	int n = nums.size();
	vector<bool> visited(n,false);
	backtracing(nums, visited);
}
void Print()
{
	int m = result.size(), n = result[0].size();
	for (int i = 0; i < m; ++i)
	{
		for (int j = 0; j < n; ++j)
		{
			cout << result[i][j] << " ";
		}
		cout << endl;
	}
}
int main()
{
	vector<int> nums = { 1,2,3 };
	permute(nums);
	Print();
	//printf("%d", printf("%d", printf("%d", 43)));
	return 0;
}