vector_perm_example.cpp

利用递归查找数字的排列组合 使用了STL技术

//This program uses vector permutation function


#include<iostream>
#include<vector>
#include<string>
#include"vector_perm.h"

using namespace std;



//using iterators
void display(vector<char> perm)
{
  for(vector<char>::iterator it= perm.begin();it!=perm.end();++it)
   cout<<*it;
  cout<<endl;
}

int main()
{
  vector<char> ca;
  ca.push_back('1');
  ca.push_back('2');
  ca.push_back('3');
  ca.push_back('4');
  
  
  vector<char> cnext;
  vector_permutation(ca,cnext,display);


  return 0;
}


/*
//using arrays of string
void display(vector<string>& perm)
{
  for(vector<string>::iterator it= perm.begin();it!=perm.end();++it)
   cout<<*it<<" ";
  cout<<endl;
}

int main()
{
  vector<string> sa;
  sa.push_back("RED");
  sa.push_back("GREEN");
  sa.push_back("BLUE");
  
  
  vector<string> cnext;
  vector_permutation(sa,cnext,display);


  return 0;
}
*/