ACM刷题之ZOJ————Knuth-Morris-Pratt Algorithm

本文介绍了一个基于KMP(Knuth-Morris-Pratt)算法的实际应用案例:在给定字符串中搜索并计数特定子串“cat”和“dog”的出现次数。通过逐字符检查的方式实现了快速匹配,避免了重复比较已匹配的字符。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Knuth-Morris-Pratt Algorithm

Time Limit: 1 Second      Memory Limit: 65536 KB

In computer science, the Knuth-Morris-Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to determine where the next match could begin, thus bypassing re-examination of previously matched characters.

Edward is a fan of mathematics. He just learnt the Knuth-Morris-Pratt algorithm and decides to give the following problem a try:

Find the total number of occurrence of the strings "cat" and "dog" in a given string s.

As Edward is not familiar with the KMP algorithm, he turns to you for help. Can you help Edward to solve this problem?

Input

There are multiple test cases. The first line of input contains an integer T (1 ≤ T ≤ 30), indicating the number of test cases. For each test case:

The first line contains a string s (1 ≤ |s| ≤ 1000).

Output

For each case, you should output one integer, indicating the total number of occurrence of "cat" and "dog" in the string.

Sample Input
7
catcatcatdogggy
docadosfascat
dogdddcat
catcatcatcatccat
dogdogdogddddooog
dcoagtcat
doogdog
Sample Output
4
1
2
5
3
1
1
Hint

For the first test case, there are 3 "cat" and 1 "dog" in the string, so the answer is 4.

For the second test case, there is only 1 "cat" and no "dog" in the string, so the answer is 1.



2017浙大校赛的水题

暴力一趟就好了

下面是ac代码

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<string>
#include<iostream>
using namespace std;
#define MID(x,y) ((x+y)>>1)
#define CLR(arr,val) memset(arr,val,sizeof(arr))
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int N=2e5+7;

char c[11111]; 

int main()
{
	//freopen("f:/input.txt", "r", stdin);
	int zu,i,j,k,len1,cat,dog;
	scanf("%d",&zu);
	while(zu--)
	{
		scanf("%s",c);
		len1 = strlen(c);
		cat=dog=0;
		for(i=0;i<len1;i++)
		{
			if(c[i]=='c'&&i+2<len1)
			{
				if(c[i+1]=='a'&&c[i+2]=='t')
				{
					++cat;
					i+=2;
					continue;
				}
			}
			if(c[i]=='d'&&i+2<len1)
			{
				if(c[i+1]=='o'&&c[i+2]=='g')
				{
					++dog;
					i+=2;
					continue;
				}
			}
		}
		
		printf("%d\n",cat+dog);
	}
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值