#include <stdio.h> #include <stdlib.h> int Index_BF(char S[],char T[])//s为目标串(长串),t为模式串(可能为子串) { int i = 0,j,k; int m = 0; int flag; int lens,lent; int pos[100]; while(S[i] != '\0') { i++; } lens = i; // printf("字符串S的长度为:%d\n",lens);
Reincarnation Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 843 Accepted Submission(s): 283 Problem Description Now you are back,and have a task to do:Given you a string s consist of lower