华为oj 字符串匹配

#include<iostream>#define N 1000 using namespace std;bool isExist(char s,char *i){bool  exist = false;while(*i != '\0'){if(s == *i) {      exist = true;      return exist;  }i++; }return exist;}bool isMatch(char *a,char *b){bool flag = true;while(*a !='\0'){if(!isExist(*a,b)) { flag = false; return flag;}    ++a;}  return flag;} int main(){char slen[N],llen[N];gets(slen);gets(llen);if(isMatch(slen,llen))  cout<<"true"<<endl; else  cout<<"false"<<endl;return 0; }