九度OJ—题目1094：String Matching
内容导读
互联网集市收集整理的这篇技术教程文章主要介绍了九度OJ—题目1094：String Matching，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含1749字，纯文字阅读大概需要3分钟。
内容图文
- 题目描述：
-
Finding all occurrences of a pattern in a text is a problem that arises frequently in text-editing programs.
Typically,the text is a document being edited,and the pattern searched for is a particular word supplied by the user.
We assume that the text is an array T[1..n] of length n and that the pattern is an array P[1..m] of length m<=n.We further assume that the elements of P and T are all alphabets(∑={a,b...,z}).The character arrays P and T are often called strings of characters.
We say that pattern P occurs with shift s in the text T if 0<=s<=n and T[s+1..s+m] = P[1..m](that is if T[s+j]=P[j],for 1<=j<=m).
If P occurs with shift s in T,then we call s a valid shift;otherwise,we calls a invalid shift.
Your task is to calculate the number of vald shifts for the given text T and p attern P.
- 输入：
-
For each case, there are two strings T and P on a line,separated by a single space.You may assume both the length of T and P will not exceed 10^6.
- 输出：
-
You should output a number on a separate line,which indicates the number of valid shifts for the given text T and pattern P.
- 样例输入：
-
abababab abab
- 样例输出：
-
3
- 答疑：
- 解题遇到问题?分享解题心得?讨论本题请访问：http://t.jobdu.com/thread-7817-1-1.html
#include <stdio.h>
#include <string.h>
char s1[1000001];
char s2[1000001];
int main()
{
while(scanf("%s%s",s1,s2)!=EOF)
{
int ans=0;
char *s=s1;
while(s=strstr(s,s2))
{
s++;
ans++;
}
printf("%d\n",ans);
}
return 0;
}
/**************************************************************
Problem: 1094
User: vhreal
Language: C
Result: Accepted
Time:20 ms
Memory:2868 kb
****************************************************************/
原文：http://blog.csdn.net/wtyvhreal/article/details/42360961
内容总结
以上是互联网集市为您收集整理的九度OJ—题目1094：String Matching全部内容，希望文章能够帮你解决九度OJ—题目1094：String Matching所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。
内容备注
版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。
内容手机端
扫描二维码推送至手机访问。