uva 10340 All in All(子串)
2015-02-19 23:57
246 查看
题目大意:给出两个字符串,判断串1是否为串2的子串,这里的子串不要求在串2中连续,但是要保证顺序一致。
解题思路:递归遍历。
#include <cstdio>
int main() {
char A[100000], B[100000];
while (scanf("%s%s", A, B) != EOF) {
int cnt = 0;
for (int i = 0; B[i]; i++)
if (B[i] == A[cnt])
cnt++;
printf(!A[cnt] ? "Yes\n" : "No\n");
}
return 0;
}
解题思路:递归遍历。
#include <cstdio>
int main() {
char A[100000], B[100000];
while (scanf("%s%s", A, B) != EOF) {
int cnt = 0;
for (int i = 0; B[i]; i++)
if (B[i] == A[cnt])
cnt++;
printf(!A[cnt] ? "Yes\n" : "No\n");
}
return 0;
}
相关文章推荐
- uva 10340 All in All(子串)
- UVA 10340 - All in All
- uva 10340 All in All
- UVA - 10340 All in All
- uva 10340 all in all
- UVA - 10340 All in All(水题)
- UVA 10340 - All in All
- UVA 10340 All in All
- uva 10340 - All in All
- UVA 10340-ALL in ALL
- UVa 10340 - All in All
- UVa 10340 - All in All
- uva 10340 all in all
- UVa 10340 All in All
- uva 10340 All in All
- 【习题3-9】UVA - 10340 All in All
- UVa 10340 - All in All
- uva 10340 All in All
- UVa 10340 - All in All
- UVA-10340 All in All