全排列--非递归实现

// Permutation.cpp : 定义控制台应用程序的入口点。

#include "stdafx.h"
#include <iostream>


using namespace std;
bool IsEqual(const char ch[5], const char s[5])
{
for (int i = 0; i < 5; i++)
{
if (ch[i] != s[i])
return 1;
}
return 0;

}

//判断是否含有字符串，含有返回1，没有保存并返回0

bool IsInclude(char arr[][5], const char s[5],int &Num){


if (Num==0){
for (int i = 0; i < 5; i++)
arr[0][i] = s[i];
Num++;
return 0;
}
else{
for (int i = 0; i < Num; i++){
//Equal?
if (IsEqual(arr[i], s)){
//
continue;
}
else{
return 1;
}
}
for (int j = 0; j < 5; j++)
arr[Num][j] = s[j];
Num++;
return 0;
}

}

//插入法产生一个新的字符串source

void func(const char str[5],char source[5],int n,int k){

//n表示那个字符，k表示位置，str原串，source目的串

if (n == k){
for (int i = 0; i < 5; i++)
{
source[i] = str[i];
}
return;
}
char arr[4];
for (int i = 0,j=0; i < 4; ++j){
if (j == n)
continue;
arr[i] = str[j];
i++;
}
int i = 0;
for (i = 0; i < k; i++){
source[i] = arr[i];
}
//i==k
source[i] = str[n];
i++;
for (; i < 5; i++)
{
source[i] = arr[i - 1];
}

}

//输出

void print(const char str[5]){
for (int i = 0; i < 5; i++)
cout << str[i] << "    ";
cout << endl;


}
int _tmain(int argc, _TCHAR* argv[])
{
const char str[5] = {'1','2','3','1','5'};
char copystr[5] = {'0'};
char source[32][5] = { '0' };
int n; int Num = 0;
bool val = 0;
for (int i = 0; i < 5; i++)
{
n = i;
for (int j = 0; j < 5; j++){
func(str,copystr,n,j);
/*print(copystr);*/
val = IsInclude(source,copystr,Num);
if (!val)
print(source[Num-1]);
}
}
getchar();
return 0;
}