Knuth-Morris-Pratt Algorithm
来源:互联网 发布:软件文档的地位 编辑:程序博客网 时间:2024/06/05 14:44
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.
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.
思路:三层判断就可以了。
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int main(){ int n,m,i,j,k; string s; scanf("%d",&n); getchar(); int sum; while(n--) { sum=0; cin>>s; for(i=0;i<s.size();i++) { if(s[i]=='c') { if(s[i+1]=='a') { if(s[i+2]=='t') sum++; } } if(s[i]=='d') { if(s[i+1]=='o') { if(s[i+2]=='g') sum++; } } } printf("%d\n",sum); } return 0;}
阅读全文
0 0
- Knuth-Morris-Pratt algorithm
- Knuth-Morris-Pratt Algorithm
- The Knuth-Morris-Pratt Algorithm
- ZOJ 3957 Knuth-Morris-Pratt Algorithm
- zoj 3957 Knuth-Morris-Pratt Algorithm
- The Knuth-Morris-Pratt
- The Knuth-Morris-Pratt Algorithm in my own words
- The Knuth-Morris-Pratt Algorithm in my own words
- The Knuth-Morris-Pratt Algorithm in my own words
- KMP算法(The Knuth-Morris-Pratt Algorithm)
- KMP算法——Knuth–Morris–Pratt algorithm
- The Knuth-Morris-Pratt Algorithm KMP模式匹配算法
- zoj3957——Knuth-Morris-Pratt Algorithm(KMP)
- The Knuth-Morris-Pratt Algorithm in my own words
- KMP 算法(Knuth–Morris–Pratt algorithm)
- Knuth-Morris-Pratt string matching
- KMP(Knuth-Morris-Pratt)算法
- KMP (Knuth-Morris-Pratt) algorithm introduction to algorithm 3rd, example 32.4
- Tablayout与Viewpager里添加Xlistview实现上拉下拉
- JDBC通用工具包
- switch语句的几种反汇编结构及效率分析
- 模板类的使用
- rabbitmq 交换模式-Direct
- Knuth-Morris-Pratt Algorithm
- ssh使用加密方式
- <mvc:annotation-driven/>
- manacher算法 洛谷3805 manacher
- 面试总结
- js函数式编程
- java编程中遇到的时区与时间问题总结
- HDU
- C语言排序之堆排序篇