1614: Problem 3
Time Limit: 1 Sec Memory Limit: 128 MB
[Submit][Status][Web Board]
Description

fjxmlhx hates marshtomp, so he wants to ignore the “marshtomp” in every sentences. In order to making the sentence complete, he changes the word “marshtomp” into “fjxmlhx”

please create a class, then you must solve the problem via calling the method of the class with the object of the class.

Input

the input contains several lines

each line there exists a string whose length is no more than 200

Attention: the end of line has nothing to do with the beginning of the next line

Output

print the answer of the problem

Sample Input

marshTomp is beaten by fjxmlhx!
AmarshtompB

Sample Output

fjxmlhx is beaten by fjxmlhx!
AfjxmlhxB

HINT

Source
/*
對于C語言有分大小寫的子串查找函數(shù)strstr，對于這題用strstr解決不了，因為它的子串匹配根據(jù)樣例輸出可以看出是不分大小寫的，所以我就（借助不分大小寫的比較函數(shù)strncasecmp和指針）自己寫了個不分大小寫的子串匹配函數(shù)，我叫它Strstr。
*/
AC_code:

#include <stdio.h> #include <string.h> #include <algorithm> using namespace std; char *Strstr(char *a,const char *b) {int len_b = strlen(b);while(*a){if(strncasecmp(a,b,len_b)==0){return a;}a++;}return NULL; } int main() {char a[205];while(gets(a)){int len = strlen(a);char *p = a;const char *q ="marshTomp",*f = "fjxmlhx";while(Strstr(p,q)){char *start = Strstr(p,q);*start = '\0';*(start+1) = '\0';strncpy(start+2,f,7);p++;}for(int i = 0; i < len; i++){if(a[i]!='\0')printf("%c",a[i]);}printf("\n");}return 0; }

總結

以上是生活随笔為你收集整理的不分大小写的Strstr的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。