-
题目描述:
-
给定一个由不同的小写字母组成的字符串,输出这个字符串的所有全排列。
我们假设对于小写字母有'a' < 'b' < ... < 'y' < 'z',而且给定的字符串中的字母已经按照从小到大的顺序排列。
-
输入:
-
输入只有一行,是一个由不同的小写字母组成的字符串,已知字符串的长度在1到6之间。
-
输出:
-
输出这个字符串的所有排列方式,每行一个排列。要求字母序比较小的排列在前面。字母序如下定义:
已知S = s1s2...sk , T = t1t2...tk,则S < T 等价于,存在p (1 <= p <= k),使得
s1 = t1, s2 = t2, ..., sp - 1 = tp - 1, sp < tp成立。
-
样例输入:
-
abc
-
样例输出:
-
abc acb bac bca cab cba
-
提示:
-
每组样例输出结束后要再输出一个回车。
-
-
采用回溯法,即深度优先搜索思想,结果没问题,但是总是TLE:
-
后来参考 http://blog.csdn.net/lhyer/article/details/48196181,将queue转化为char数组,即输出时不再遍历,而是一句printf().果断AC#include<iostream> #include<stdio.h> #include<string> #include<memory.h> using namespace std; void DFS(string str, bool *visited, int *queue, int rear); int main() { char cstr[7]; string str; bool *visited; int *queue; int rear; while(scanf("%s", cstr) != EOF) { //scanf("%s", cstr); str = string(cstr); visited = new bool[str.size()]; memset(visited, false, str.size() * sizeof(bool)); queue = new int[str.size()]; rear = -1; DFS(str, visited, queue, rear); cout << endl; delete[] queue; delete[] visited; } //system("pause"); return 0; } void DFS(string str, bool *visited, int *queue, int rear) { if(rear == str.size() - 1) { for(int i = 0; i <= rear; i++) //cout << str[queue[i]]; printf("%c", str[queue[i]]); //cout << endl; printf("\n"); return ; } for(int i = 0; i < str.size(); i++) { if(visited[i]) continue; visited[i] = true; queue[++rear] = i; DFS(str, visited, queue, rear); visited[i] = false; rear--; } } /************************************************************** Problem: 1120 User: esonjohn Language: C++ Result: Time Limit Exceed ****************************************************************/
-
#include<iostream> #include<stdio.h> #include<string> #include<memory.h> using namespace std; void DFS(string str, bool *visited, char *queue, int rear); int main() { char cstr[7]; string str; bool *visited; char *queue; int rear; while(scanf("%s", cstr) != EOF) { //scanf("%s", cstr); str = string(cstr); visited = new bool[str.size()]; memset(visited, false, str.size() * sizeof(bool)); queue = new char[str.size() + 1]; queue[str.size()] = '\0'; rear = -1; DFS(str, visited, queue, rear); cout << endl; delete[] queue; delete[] visited; } //system("pause"); return 0; } void DFS(string str, bool *visited, char *queue, int rear) { if(rear == str.size() - 1) { //for(int i = 0; i <= rear; i++) //cout << str[queue[i]]; //printf("%c", str[queue[i]]); //cout << endl; printf("%s\n", queue); //printf("\n"); return ; } for(int i = 0; i < str.size(); i++) { if(visited[i]) continue; visited[i] = true; queue[++rear] = str[i]; DFS(str, visited, queue, rear); visited[i] = false; rear--; } } /************************************************************** Problem: 1120 User: esonjohn Language: C++ Result: Accepted Time:900 ms Memory:1520 kb ****************************************************************/
-