-5

I have this code to do permutations of a string.

#include <iostream> 
#include <string.h>
using namespace std;

/* Prototipo de función */
void Permutaciones(char *, int l=0); 
void sort(string scadena[]);
//array global to copy all permutations and later sort

string array[900000];
int m=0;
int main() {
int casos;
cin>>casos; 
char palabra[casos][13];
for(int i=0;i<casos;i++)
    cin>>palabra[i];

for(int i=0;i<casos;i++){
    m=0;
    Permutaciones(palabra[i]);
    sort(array);
}

  sort(array);
system("pause");
return 0;
}

void sort(string scadena[]){
string temp;

for(int i=0;i<m;i++){
    for(int j=i+1;j<m;j++){
        if(scadena[i]>scadena[j]){
            temp=scadena[i];
            scadena[i]=scadena[j];
            scadena[j]=temp;    
        }           
    }
}

for(int i=0;i<m;i++){
    for(int j=1;j<m;j++){
        if(scadena[i]==scadena[j] && j!=i){
            for(int k=j;k <m; k++){
                scadena[k]=scadena[k+1];
            }
            m--;
            j--;
        }

    }
}   
for(int i=0;i<m;i++){
    cout<<scadena[i]<<endl;
}   
}


void Permutaciones(char * cad, int l) {
char c;    /* variable auxiliar para intercambio */
int i, j;  /* variables para bucles */
int n = strlen(cad);

for(i = 0; i < n-l; i++) {
  if(n-l > 2){
    Permutaciones(cad, l+1);
  } 
  else {
        array[m]=cad;
        m++;            
  }
  /* Intercambio de posiciones */
  c = cad[l];
  cad[l] = cad[l+i+1];
  cad[l+i+1] = c;
  if(l+i == n-1) {
     for(j = l; j < n; j++){
        cad[j] = cad[j+1];
     } 
     cad[n] = 0;
  }
 }
}

And the code generates all permutations fine, and later sorted the array and it works fine. But when i am intenting remove the repeated strings, the code show me somethings repeated, and not sorted.

Who can say me what is my error?

4

2 回答 2

1

您可以使用标准库更轻松地完成它：

#include <algorithm>

using namespace std;

int main() {
    int a[] = {1, 2, 5, 6, 7};
    int n = 5;
    do {
// print array a
    } while (next_permutation(a, a + n));
}

除非任务是您自己实现它。当然，在您尝试以这种方式排列它之前，请确保您的数组已排序，否则您会错过一些排列。

于 2013-07-02T03:13:45.107 回答
0

HERE，是一个最简单的代码，用于生成给定数组的所有组合/排列，不包括一些特殊库（仅包括iostream.h和字符串），并且不使用一些特殊的命名空间（仅使用命名空间 std）。

void shuffle_string_algo( string ark )
{

//generating multi-dimentional array:

char** alpha = new char*[ark.length()];
for (int i = 0; i < ark.length(); i++)
    alpha[i] = new char[ark.length()];

//populating given string combinations over multi-dimentional array
for (int i = 0; i < ark.length(); i++)
    for (int j = 0; j < ark.length(); j++)
        for (int n = 0; n < ark.length(); n++)
            if( (j+n) <= 2 * (ark.length() -1) )
                if( i == j-n)
                    alpha[i][j] = ark[n];
                else if( (i-n)== j)
                    alpha[i][j] = ark[ ark.length() - n];

if(ark.length()>=2)
{
    for(int i=0; i<ark.length() ; i++)
    {
        char* shuffle_this_also = new char(ark.length());
        int j=0;
        //storing first digit in golobal array ma
        ma[v] = alpha[i][j];

        //getting the remaning string
        for (; j < ark.length(); j++)
            if( (j+1)<ark.length())
                shuffle_this_also[j] = alpha[i][j+1];
            else
                break;
        shuffle_this_also[j]='\0';

        //converting to string
        string send_this(shuffle_this_also);

        //checking if further combinations exist or not
        if(send_this.length()>=2)
        {
            //review the logic to get the working idea of v++ and v--
            v++;
            shuffle_string_algo( send_this);
            v--;
        }
        else
        {
            //if, further combinations are not possiable print these combinations 
            ma[v] = alpha[i][0];
            ma[++v] = alpha[i][1];
            ma[++v] = '\0';
            v=v-2;

            string disply(ma);
            cout<<++permutaioning<<":\t"<<disply<<endl;
        }
    }
}
}

和主要：

int main()
{
string a;
int ch;
do
{
    system("CLS");
    cout<<"PERMUNATING BY ARK's ALGORITH"<<endl;
    cout<<"Enter string: ";
    fflush(stdin);
    getline(cin, a);

    ma = new char[a.length()];

    shuffle_string_algo(a);

    cout<<"Do you want another Permutation?? (1/0): ";
    cin>>ch;
} while (ch!=0);

return 0;
}

希望！它可以帮助你！如果您在理解逻辑方面遇到问题，请在下面发表评论，我将进行编辑。

于 2014-08-02T15:28:11.907 回答