// BF 算法 (下标都是从0开始)
int BrouteForce(const char* S, const char* T)
{
if(S == NULL || T==NULL)
{
return -1;
}
int lenS = strlen(S); //主串的长度
int lenT = strlen(T); //模式串的长度
int i = 0;
int j = 0;
int k = 0;
for(i = 0; i<= lenS-lenT; i++)
{
k = i;
while (S[k++] == T[j++] && j < lenT);
if(j == lenT)
{
return i;
}
else
{
j = 0;
}
}
return -1;
}
// KMP 算法 (下标都是从0开始)
void GetNextval(const char* T, int *next)
{
int len = strlen(T);
int i = 0; //后缀
int j = -1; //前缀 (后缀下标i不需要回退,当匹配失败时,只需要前缀下标j回退即可)
next[0] = -1;
while(i<len)
{
if(j == -1 || T[i]==T[j])
{
i++;
j++;
next[i] = j; // 更新后缀i下标的next[]值
}
else
{
j = next[j];
}
}
return ;
}
// 从主串S下标pos处开始与模式串T匹配
int KMP(const char* S, const char* T, int *next, int pos)
{
int lenS = strlen(S); //主串长度
int lenT = strlen(T);
int i = pos; //主串下标(主串下标i不需要回退,当匹配失败时,只需要模式串j的下标回退即可)
int j = 0;
GetNextval(T, next);
//while(i <= lenS-lenT && j<lenT)
//while(i < lenS && j<lenT)
while (i < lenS && j<lenT)
{
if(j == -1 || S[i] == T[j]) //j == -1 表示当前没有前缀
{
i++;
j++;
}
else
{
j = next[j];
}
}
if(j >= lenT)
{
return i-lenT;
}
return -1;
}
利用STL实现KMP算法
void getNext(string T, vector<int> &next);
int KMP(string S, string T)
{
if (S.empty() || T.empty())
{
return - 1;
}
vector<int> next(T.length()+1, -1);
getNext(T, next);
int i = 0;
int j = 0;
int len1 = S.length();
int len2 = T.length();
while (i < len1 && j < len2)
{
if (-1 == j || S.at(i) == T.at(j))
{
i++;
j++;
}
else
{
j = next[j];
}
}
if (j >= T.length())
{
return i - T.length();
}
else
{
return -1;
}
}
void getNext(string T, vector<int> &next)
{
int i = 0; //后缀
int j = -1; //前缀
while (i < T.length())
{
if (-1 == j || T.at(i) == T.at(j))
{
next[++i] = ++j;
}
else
{
j = next[j];
}
}
}
字符串的交错匹配问题
给定s1,s2,s3,判断s3是否是由s1和s2交织而成。
比如:
Given:
s1 = "aabcc",
s2 = "dbbca",
When s3 = "aadbbcbcac", return true.
When s3 = "aadbbbaccc", return false.
bool isInterleave(string s1, string s2, string s3)
{
int m = s1.length();
int n = s2.length();
vector<vector<int>> temp(m+1, vector<int>(n+1, 0)); //m行n列
temp[i][j]表示的是S1的前(0..i-1)个与s2的前(0...j-1)个能否匹配S3
temp[0][0] = 1;
int i = 0, j = 0;
for (i = 1; i <= m; i++)
{
temp[i][0] = (s1[i-1] == s3[i-1])&& temp[i-1][0];
}
for (j = 1; j <= n; j++)
{
temp[0][j] = (s2[j-1] == s3[j-1]) && temp[0][j-1];
}
for (i = 1; i <= m; i++)
{
for (j = 1; j <= n; j++)
{
temp[i][j] = (s1[i - 1] == s3[i + j - 1]) && temp[i - 1][j] || (s2[j - 1] == s3[j + i - 1]) && temp[i][j-1];
}
}
return temp[m][n];
}