【STL】【algorithm】next_permutation全排列算法

https://blog.csdn.net/c18219227162/article/details/50301513
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
	int a[9]={1,2,3,4,5,6};
	do{
		for(int i=0;i<6;i++)
			cout<<a[i]<<' ';
		cout<<endl;
	}while(next_permutation(a,a+6));
}

猜你喜欢

转载自blog.csdn.net/u011590573/article/details/80158188