Orders

最新推荐文章于 2024-07-08 16:28:08 发布

转载最新推荐文章于 2024-07-08 16:28:08 发布 · 99 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/8023spz/p/7789052.html

本文介绍了一种基于深度优先搜索的算法，用于解决仓库经理如何有效处理预知订单的问题。该算法可以找出所有可能的仓库访问顺序，确保每种商品都能被正确处理，且输出结果按字母顺序排列。

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

The stores manager has sorted all kinds of goods in an alphabetical order of their labels. All the kinds having labels starting with the same letter are stored in the same warehouse (i.e. in the same building) labelled with this letter. During the day the stores manager receives and books the orders of goods which are to be delivered from the store. Each order requires only one kind of goods. The stores manager processes the requests in the order of their booking.

You know in advance all the orders which will have to be processed by the stores manager today, but you do not know their booking order. Compute all possible ways of the visits of warehouses for the stores manager to settle all the demands piece after piece during the day.

Input

Input contains a single line with all labels of the requested goods (in random order). Each kind of goods is represented by the starting letter of its label. Only small letters of the English alphabet are used. The number of orders doesn't exceed 200.

Output

Output will contain all possible orderings in which the stores manager may visit his warehouses. Every warehouse is represented by a single small letter of the English alphabet -- the starting letter of the label of the goods. Each ordering of warehouses is written in the output file only once on a separate line and all the lines containing orderings have to be sorted in an alphabetical order (see the example). No output will exceed 2 megabytes.

Sample Input

bbjd

Sample Output

bbdj
bbjd
bdbj
bdjb
bjbd
bjdb
dbbj
dbjb
djbb
jbbd
jbdb
jdbb


输出有重复字符的全排列，dfs。

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <stack>
#include <map>

using namespace std;
int vis[26],n;
char b[201];
void dfs(int k)
{
    if(k == n)
    {
        cout<<b<<endl;
        return;
    }
    for(int i = 0;i < 26;i ++)
    {
        if(!vis[i])continue;
        vis[i] --;
        b[k] = 'a' + i;
        dfs(k + 1);
        vis[i] ++;
    }
}
int main()
{
    char ch;
    while((ch = cin.get())!='\n')
    {
        n ++;//记录字符个数
        vis[ch - 'a']++;//记录每个字母的个数
    }
    b[n] = '\0';
    dfs(0);
}