全排列实现

#include<iostream>
#include<vector>
using namespace std;
class Node{
public:
int number;
int flag;//R:1 L:-1
};
class AllPlace{
public:
vector<Node> A;
AllPlace(int t);
void Out();
void Place();
bool CanDo();
};
AllPlace::AllPlace(int t ){

A.resize(t);
for(int i=0;i<t;i++){
A[i].number=i+1;
A[i].flag=-1;
}

}
void AllPlace::Out(){
for(int i=0;i<A.size();i++)
cout<<A[i].number<<"  ";
}
bool AllPlace::CanDo(){
int m=0;
int n=A.size();
if(A[0].flag==-1)m++;
if(A[n-1].flag==1)n--;
for(int i=m;i<n;i++)
if(A[i].number>A[i+A[i].flag].number)return true;
return false;
}
void AllPlace::Place(){
int count1=1;
cout<<count1<<" : ";
Out();
cout<<endl;
count1++;

while(CanDo()){
int k=-1;
int max1=-1;
for(int i=0;i<A.size();i++){
if(A[i].number>A[i+A[i].flag].number&&A[i].number>max1&&i+A[i].flag>=0&&i+A[i].flag<A.size()){k=i;max1=A[i].number;}
}
int m=k+A[k].flag;
max1=A[k].number;
swap(A[k],A[m]);
for(int i=0;i<A.size();i++)
if(A[i].number>max1)A[i].flag=-A[i].flag;
cout<<count1<<" : ";
Out();
cout<<endl;
count1++;
}

}
int main(){
AllPlace s(3);
s.Place();
return 0;
}