是个无法保存状态的算法
主要的想法是置换,对应于同济acm的1002题。
按顺序打出所给字串的全排列。(输入串长度不大于10)
/*--------------------
full permutation.
sods 2005/10/31
44 k 3 ms
---------------------*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX_SIZE 10
#define SWAP(x, y) do { char t=(x); (x)=(y); (y)=t; } while(0)
char nums[MAX_SIZE] = {0};
int len;
void printNums (char* s)
{
if (*s) {
putchar (*s++);
while (*s) {
putchar(' ');
putchar(*s++);
}
}
putchar ('/n');
}
void permutation(char * cs, int n) {
char buf[MAX_SIZE] = {0};
int i;
strncpy (buf, cs, n);
if (n==2) {
printNums (nums);
SWAP(cs[0], cs[1]);
printNums (nums);
strncpy (cs, buf, n);
return ;
}
for (i=0; i<n; i++) {
if (i!=0) {
char t = cs[i];
strncpy (cs, buf, n);
memmove (cs+1, cs, i);
cs[0] = t;
}
permutation (cs+1, n-1);
}
strncpy (cs, buf, n);
return ;
}
int main (void)
{
scanf("%10s", nums);
permutation (nums, strlen (nums));
/*getch ();*/
return 0;
}