给定两个字符串str1和str2(长度均<=10000),问字符串str2内每个字符是否能在字符串str1内找到。
输入说明
第1行输入字符串str1
第2行输入字符串str2
输出说明
若能找到,则输出‘Y’,否则输出‘N’
输入样例复制
abdcdewrtde
wbaqx
输出样例复制
YYYNN
#include<iostream>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;
map<char,int>mp={{'a',0},{'b',0},{'c',0},{'d',0},{'e',0},{'f',0},{'g',0},{'h',0},{'i',0},{'j',0},{'k',0},{'l',0},{'m',0},{'n',0},{'o',0},{'p',0},{'q',0},{'r',0},{'s',0},{'t',0},{'u',0},{'v',0},{'w',0},{'x',0},{'y',0},{'z',0},};
int main()
{
string s1,s2;
cin>>s1>>s2;
for(int i=0;i<s1.length();i++)
{
if(s1[i]>='A'&&s1[i]<='Z')
s1[i]+=32;
mp[s1[i]]=1;
}
for(int i=0;i<s2.length();i++)
{
if(mp[s2[i]]==1) cout<<'Y';
else cout<<'N';
}
}