dfs版:
#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<cmath>
#include<algorithm>
#define ll long long
#define MAX 0x3f3f3f3f
const ll MOD=1e+9+7;
using namespace std;
char c[10];
int s[10];
int book[10];
int len,minn,maxx;
void dfs(int step)
{
if(step==len+1){
for(int i=1;i<=len;i++)printf("%d",s[i]);
cout<<endl;
return ;
}
for(int i=minn;i<=maxx;i++){
if(book[i]){
book[i]--;
s[step]=i;
dfs(step+1);
book[i]++;
}
}
}
int main()
{
memset(c,0,sizeof(c));
memset(s,-1,sizeof(s));
memset(book,0,sizeof(book));
gets(c);
len=strlen(c);
for(int i=0;i<len;i++){
book[(int)(c[i]-'0')]++;
if(i==0){
minn=maxx=(int)(c[i]-'0');
}
else {
if((int)(c[i]-'0')>maxx)maxx=(int)(c[i]-'0');
if((int)(c[i]-'0')<minn)minn=(int)(c[i]-'0');
}
}
dfs(1);
return 0;
}
51nod 1384题,用了上述代码,game over!超时。
由于,我没想到其他的什么办法,我参考了别人的代码:
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <iostream>
#include <algorithm>
#include <ctime>
using namespace std;
char str[20];
int main(){
scanf("%s", str);
int len = strlen(str);
sort(str, str+len);
do{
printf("%s\n", str);
}while(next_permutation(str,str+len));
return 0;
}
刚开始看到有点惊讶,stl挺神奇呀,还有这个。
而且还不超时,666!
待我研究一下,再继续补充此项!