九度OJ 1094:String Matching(字符串匹配) (计数)
来源:互联网 发布:翻样算尺软件 编辑:程序博客网 时间:2024/06/05 11:33
- 题目描述:
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
- 来源:
- 2006年上海交通大学计算机研究生机试真题
思路:
简单的计数题。
代码:
#include <stdio.h>#include <string.h> #define N 1000000 int main(void){ int tlen, plen, i; char t[N+1], p[N+1]; while (scanf("%s%s", t, p) != EOF) { tlen = strlen(t); plen = strlen(p); int count = 0; for(i=0; i<=tlen-plen; i++) { if (t[i] == p[0] && strncmp(t+i, p, plen) == 0) count ++; } printf("%d\n", count); } return 0;}/************************************************************** Problem: 1094 User: liangrx06 Language: C Result: Accepted Time:30 ms Memory:2788 kb****************************************************************/
- 九度OJ 1094:String Matching(字符串匹配) (计数)
- 九度OJ 1094 String Matching
- 九度OJ 1094 String Matching
- <九度 OJ>题目1094:String Matching
- 九度oj-1094-String Matching
- 字符串匹配(String matching)[No. 76]
- 九度OJ 1165:字符串匹配 (模式匹配)
- 九度OJ—题目1094:String Matching
- 字符串匹配(String Matching)
- NYOJ 5 Binary String Matching (kmp 字符串匹配)
- NYOJ 5 Binary String Matching (kmp 字符串匹配)
- 九度oj 题目1165:字符串匹配
- 九度OJ-题目1165:字符串匹配
- Binary String Matching(南阳理工OJ)
- 九度OJ 1098:字母统计 (计数)
- 九度OJ 1149:子串计算 (计数、排序)
- 九度OJ 1182:统计单词 (计数)
- 九度OJ 1199:找位置 (计数)
- Objective-C 类,对象,属性,方法
- 第8周、项目4—字符串加密
- Python中序列的切片和加号
- 第8周项目1——建立顺序串的算法库
- HDOJ 2243 考研路茫茫——单词情结(AC自动机+矩阵快速幂)
- 九度OJ 1094:String Matching(字符串匹配) (计数)
- 2015-10-23 【项目5 - 计数的模式匹配】
- [MSSQL]磁盘空间&SQL日志&作业执行情况
- 第八周上机实践—项目2—建立链串的算法库
- WEB缓存原理
- Objective - C 字符串 数组 字典 集合的基本使用
- 第7周实践项目4 - 队列数组
- 【Android应用开发】Android Studio 错误集锦 -- 将所有的 AS 错误集合到本文
- 高精度除法与求余C++版和java版