车厢调度（回溯法）递归实现

#include<iostream.h>
#include<assert.h>

int count=0;
class stack
{
private:
int * element;
int maxsize;
int top;
public:
void friend  search(stack &s1,stack &s2,stack &s3);
stack(int n)
{ element=new int [n];
   maxsize=n;
   assert(element!=NULL);
   top=-1;
}
    void stack::push(int n)
{
  assert(!isfull());
  top++;
  element[top]=n;
}
int stack::pop()
{
  assert(!isempty());
  int a=element[top];
  top--;
  return a;
}
bool isfull()
{
  if(top==maxsize-1)
   return 1;
        else
     return 0;
}
bool isempty()
{
  if(top==-1)
            return 1;
  else
   return 0;
}
void stack::print()
{  count++;
    for(int i=0;i<top+1;i++) 
     cout<<element[i];
    cout<<endl;
}
};
void search(stack &s1,stack &s2,stack &s3)
{
if(!s1.isempty())
{
  s2.push(s1.pop());
  search(s1,s2,s3);
  s1.push(s2.pop());
}
if(!s2.isempty())
{
  s3.push(s2.pop());
  search(s1,s2,s3);
  s2.push(s3.pop());
}
if( s3.isfull())
{
     s3.print();
}
}
void main()
{
cout<<"请输车厢长度n： ";
int n; cin>>n;
    stack s1(n);
    for(int i=n;i>=1;i--)
  s1.push(i);
stack s2(n),s3(n);
cout<<"输出序列为："<<endl;
search(s1,s2,s3);
cout<<count;
}