Anagram // 深度优先搜索（代码不正确）

最新推荐文章于 2023-07-24 17:41:02 发布

LMengi000

最新推荐文章于 2023-07-24 17:41:02 发布

阅读量560

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM-dfs+bfs+各种搜索

本文链接：https://blog.youkuaiyun.com/LMengi000/article/details/80147909

ACM-dfs+bfs+各种搜索专栏收录该内容

24 篇文章

订阅专栏

本文介绍了一个算法问题，即如何从给定的一组字母中生成所有可能的单词组合，并确保输出结果既不会重复也不会遗漏，同时要求输出结果按字母顺序排列。文章提供了尝试解决此问题的代码示例，但代码存在问题，期待读者指正。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

You are to write a program that has to generate all possible words from a given set of letters.
Example: Given the word "abc", your program should - by exploring all different combination of the three letters - output the words "abc", "acb", "bac", "bca", "cab" and "cba".
In the word taken from the input file, some letters may appear more than once. For a given word, your program should not produce the same word more than once, and the words should be output in alphabetically ascending order.

Input

The input consists of several words. The first line contains a number giving the number of words to follow. Each following line contains one word. A word consists of uppercase or lowercase letters from A to Z. Uppercase and lowercase letters are to be considered different. The length of each word is less than 13.

Output

For each word in the input, the output should contain all different words that can be generated with the letters of the given word. The words generated from the same input word should be output in alphabetically ascending order. An upper case letter goes before the corresponding lower case letter.

Sample Input

3
aAb
abc
acba

Sample Output

Aab
Aba
aAb
abA
bAa
baA
abc
acb
bac
bca
cab
cba
aabc
aacb
abac
abca
acab
acba
baac
baca
bcaa
caab
caba
cbaa

Hint

An upper case letter goes before the corresponding lower case letter.
So the right order of letters is 'A'<'a'<'B'<'b'<...<'Z'<'z'.

Source

Southwestern European Regional Contest 1995

[Submit] [Go Back] [Status] [Discuss]

望大佬能指点一二，改了好久，总是不正

确

注：代码存在错误，第三个样例的输出结果缺少输出的种类

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
#include<math.h>
using namespace std;
#define maxn 20
char ch[maxn];
string ss;
char ss2[maxn];
int len;
int visited[maxn];
int val(char c)
{
    if(c>='A'&& c<='Z')
        return 2*(c-'A');
    else
        return 2*(c-'a')+1;
}
bool cmp(char a,char b)
{
    return val(a)<val(b);
}

void  dfs(int  x)
{
    char flag;
    if(x==len)
    {
        ch[x]=0;
        puts(ch);
        return ;
    }
    else
    {
        for(int i=0;i<len;i++)
        {
            if(flag==ss2[i])
                continue;
            if(visited[i]==0)
            {
                visited[i]=1;
                ch[x]=ss2[i];
                flag=ch[x];
                dfs(x+1);
                visited[i]=0;
            }
        }
    }
}
int main()
{
   int t;
  scanf("%d",&t);
       while(t--)
       {
           memset(visited,0,sizeof(visited));
           cin>>ss2;
           len=strlen(ss2);
           sort(ss2,ss2+len,cmp);
           //puts(ss2);
           dfs(0);
       }

   return 0;
}

注：：代码超时

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
#include<math.h>
using namespace std;
#define maxn 20
char ch[maxn];
string ss;
char ss2[maxn];
int len;
int visited[maxn];
int val(char c)
{
    if(c>='A'&& c<='Z')
        return 2*(c-'A');
    else
        return 2*(c-'a')+1;
}
bool cmp(char a,char b)
{
    return val(a)<val(b);
}
/*void dfs(int x){
	if(x==len){
	  char str[15];
	  for(int i=0;i<len;++i)
	  printf("%c",ch[i]);
	  printf("\n");
	}
	else{
		for(int i=0;i<len;++i){
			if(!visted[i]){
			  ch[x]=ss[i];
			  visted[i]=1;
			  dfs(x+1);
			  visted[i]=0;
			  while(i+1<len&&ss[i+1]==ss[i])i++;
			}
		}
	}
}*/
void  dfs(int x)
{
    if(x==len)
    {
        for(int i=0;i<len;i++)
        {
            printf("%c",ch[i]);
        }
        printf("\n");
    }
    else
    {
        for(int i=0;i<len;i++)
        {
            if(visited[i]==0)
            {
                ch[x]=ss2[i];
                visited[i]=1;
                dfs(x+1);
                visited[i]=0;
                while((i+1)<len && ss2[i+1]==ss2[i])
                    i++;
            }
        }
    }
}
int main()
{
   int t;
   while(scanf("%d",&t)!=EOF)
   {
       while(t--)
       {
           memset(visited,0,sizeof(visited));
           getchar();
           cin>>ss2;
           len=strlen(ss2);
           sort(ss2,ss2+len,cmp);
           //puts(ss2);
           dfs(0);
       }
   }
   return 0;
}