Question

如何用C语言编程解决最大子序列问题

Answer 1

#include <stdio.h>

int stringLen(char s[]) {
int len = 0;
while(s[len]) ++len;
return len;
}

int includeStr(char s[], char t[]) {
int i,j,k;
for(i = 0; s[i]; ++i) {
if(s[i] == t[0]) {
k = i + 1;
for(j = 1; t[j] == s[k] && s[k] && t[j]; ++k,++j);
if(t[j] == '\0') return i;
}
}
return -1;
}

int main() {
char s[30],t[30];
int n;
scanf("%d",&n);
while(n--) {
scanf("%s%s",t,s);
if(includeStr(s,t) >= 0)
printf("YES!\n");
else printf("NO!\n");
}
return 0;
}