C++ STL标准库：算法＜algorithm＞ next_permutation prev_permutation

最新推荐文章于 2025-07-04 11:16:11 发布

原创最新推荐文章于 2025-07-04 11:16:11 发布 · 302 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#permutation #c++ #stl #prev #next

C++ 专栏收录该内容

357 篇文章

订阅专栏

博客围绕C++ STL相关内容，涉及排列操作，包含prev、next等相关内容，在信息技术领域的C++编程方面有一定体现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>

using namespace std;

void main()
{
	deque<int> d1;
	vector<int> v1;
	int dim[] = { 1,2,3 };
	v1.assign(dim, dim + 3);
	cout << "vector v1:  ";
	copy(v1.begin(), v1.end(), ostream_iterator<int>(cout, ", "));
	cout << endl;

	cout << "queue d1(Original):  ";
	copy(v1.begin(), v1.end(), back_inserter(d1));
	copy(d1.begin(), d1.end(), ostream_iterator<int>(cout, ", "));
	cout << endl;

	while (next_permutation(d1.begin(), d1.end()))
	{
		copy(d1.begin(), d1.end(), ostream_iterator<int>(cout, ", "));
		cout << endl;
	}
	cout << "queue d1(排序后):  ";
	copy(d1.begin(), d1.end(), ostream_iterator<int>(cout, ", "));
	cout << endl;

	cout << "queue d1(准备重新按降序排列):  ";
	copy(d1.begin(), d1.end(), ostream_iterator<int>(cout, ", "));
	cout << endl;
	while (prev_permutation(d1.begin(), d1.end()))
	{
		copy(d1.begin(), d1.end(), ostream_iterator<int>(cout, ", "));
		cout << endl;
	}

	cout << "queue d1(降序排列后):  ";
	copy(d1.begin(), d1.end(), ostream_iterator<int>(cout, ", "));
	cout << endl;
	while (prev_permutation(d1.begin(), d1.end()))
	{
		copy(d1.begin(), d1.end(), ostream_iterator<int>(cout, ", "));
		cout << endl;
	}

	cout << "queue d1(再次降序排列后):  ";
	copy(d1.begin(), d1.end(), ostream_iterator<int>(cout, ", "));
	cout << endl;
}