题目大意:在给出的段落里面找出“doge”出现的次数,大小写都可以。
解题思路:字符串匹配问题,可以在之前将字母都转换成统一格式。
代码:
#include <stdio.h> #include <string.h> const int N = 1e6; char str[N]; const char *s1 = "doge"; int find () { int sum = 0; char *p = strstr(str, s1); while (p != NULL) { sum++; p = p + 4; //if (*p == '\0') // break; p = strstr (p, s1); } return sum; } int main () { int count = 0; while (scanf ("%s", str) != EOF) { for (int i = 0; i < strlen (str); i++) if (str[i] >= 'A' && str[i] <= 'Z') str[i] += 32; count += find (); } printf ("%d\n", count); return 0; }
hdu4847:Wow! Such Doge!(字符串匹配),布布扣,bubuko.com
hdu4847:Wow! Such Doge!(字符串匹配)
原文地址:http://blog.csdn.net/u012997373/article/details/37592673