若是凉夜已成梦

青春里 总有些事情要努力去做 总有些梦想要拼命去追。


  • 运维

  • 前端

  • 编程

  • 随笔

  • hust-oj

1512: Common Permutation

发表于 2017-10-06   |   分类于 HUSTOJ   |   阅读次数 1,052

题目描述

Given two strings a and b, print the longest string x of letters such that there is a permutation of x that is a subsequence of a and there is a permutation of x that is a subsequence of b.

输入

The input file contains several cases, each case consisting of two consecutive lines. This means that lines 1 and 2 are a test case, lines 3 and 4 are another test case, and so on. Each line contains one string of lowercase characters, with first line of a pair denoting a and the second denoting b. Each string consists of at most 1,000 characters.

输出

For each set of input, output a line containing x. If several x satisfy the criteria above, choose the first one in alphabetical order

样例输入

pretty
women
walking
down
the
street

样例输出

e
nw
et

参考代码

#include<stdio.h>
#include<string.h>
int main() 
{
    int k,j;
    char a[1000],b[1000],i;
    do 
    {
        gets(a);
        gets(b);
        for (i='a';i<='z';i++) 
        {
            for (j=0;j<strlen(a);j++) 
            {
                if(a[j]==i) 
                {
                    for (k=0;k<strlen(b);k++) 
                    {
                        if(b[k]==a[j]) 
                        {
                            printf("%c",i);
                            break;
                        }
                    }
                    break;
                }
            }
        }
        printf("n");
    }while(scanf("%d",&a)!=EOF);
    return 0;
}

解析

暂无

hustoj

发表评论 取消回复

邮箱地址不会被公开。 必填项已用*标注

*
*


hoxis wechat
著作权归作者所有
站点更新说明
  • 文章目录
  • 站点概览
若是凉夜已成梦

若是凉夜已成梦

青春里 总有些事情要努力去做 总有些梦想要拼命去追。

1904 日志
6 分类
12 标签
RSS
weibo github twitter facebook

友情链接

Dreams孤独患者 原站点 Skip
© 2017 若是凉夜已成梦
Powered by WordPress | 已运行
Theme By NexT.Mist