索引
KMP算法是一种改进的字符串匹配算法
利用匹配失败后的信息【已匹配的前缀中,对前缀的最大重复子缀】,尽量减少模式串与主串的匹配次数以达到快速匹配的目的。
时间复杂度O(m+n)
next数组优化为:nexval数组【也有可能是考试中所求next看具体的代码区分】
//next=nexval-1
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void get_next(int *next,char *s,int Is){
int i=0,j=-1;
next[0]=-1;
while(i<Is){
if(j==-1||s[i]==s[j]){//匹配
j++;
i++;
if(s[i]==s[j]) next[i]=next[j];
else next[i]=j;//不匹配
}
else j=next[j];//不匹配,
}
}
int kmp(int *next,char *s,int Is,char *t,int It){
int i,j=0;
while(i<It&&j<Is){
if(j==-1||t[i]==s[j]){
j++;
i++;
}
else j=next[j];
}
if(j>=Is) return i+1-j;
else return -1;
}
function lcs(word1, word2) {
var max = 0;
var index = 0;
var lcsarr = new Array(word1.length+1);
for (var i = 0; i <= word1.length+1; ++i) {
lcsarr[i] = new Array(word2.length+1);
for (var j = 0; j <= word2.length+1; ++j) {
lcsarr[i][j] = 0;
}
}
for (var i = 0; i <= word1.length; ++i) {
for (var j = 0; j <= word2.length; ++j) {
if (i == 0 || j == 0) {
lcsarr[i][j] = 0;
}
else {
if (word1[i-1] == word2[j-1]) {
lcsarr[i][j] = lcsarr[i-1][j-1] + 1;
}
else {
lcsarr[i][j] = 0;
}
}
if (max < lcsarr[i][j]) {
max = lcsarr[i][j];
index = i;
}
}
}
var str = "";
if (max == 0) {
return "";
}
else {
for (var i = index-max; i <= max; ++i) {
str += word2[i];
}
return str;
}
}
console.log(lcs("hhs",'hhh'));
console.log(lcs("hs",'hhh'));
console.log(lcs("whs",'rhhh'));
console.log(lcs("habs",'eab'));