server2008网站建设,网站开发软件网站开发,网页设计与网站建设习题答案,电商详情页模板字符串的模式匹配本文先实现最基本的回溯实现的已经KMP算法#xff0c;BM算法后面博文继续实现。ps:本篇博文强烈参考了July大神的作品#xff0c;地址http://blog.csdn.net/v_july_v/article/details/6545192.再次感激大神~~ 1.最基本的回溯实现字符串模式匹配 package com.… 字符串的模式匹配本文先实现最基本的回溯实现的已经KMP算法BM算法后面博文继续实现。ps:本篇博文强烈参考了July大神的作品地址http://blog.csdn.net/v_july_v/article/details/6545192.再次感激大神~~ 1.最基本的回溯实现字符串模式匹配 package com.sheepmu;public class KMPText
{public static void main(String[] args){String s0abcdeabckkfgh;String s1abck;char[] as0s0.toCharArray();char[] as1s1.toCharArray();System.out.println(getIndex(as0,as1));}public static int getIndex(char[] as0,char[] as1){int len0as0.length;int len1as1.length;int i0,j0;while(ilen0jlen1){if(as0[i]as1[j]){i;j;}else{ii-j1;j0;}}if(jlen1){return i-j;}return -1;}
}2.KMP算法实现字符串模式匹配 package com.sheepmu;public class KMPText
{public static void main(String[] args){String s0abcdeabckkfgh;String s1abcke;char[] as0s0.toCharArray();char[] as1s1.toCharArray();System.out.println(getKMP(as0,as1));}public static int[] next(char[] as1){int[] nextnew int[as1.length];next[0]-1;int len1as1.length;int i0,j-1;while(ilen1-1)//!!!!!!!!!!!!!记得-1{if(j-1||as1[i]as1[j]){i;j;if(as1[i]!as1[j]){next[i]j; }else{next[i]next[j];}}else{jnext[j];}}return next;}public static int getKMP(char[] as0,char[] as1){ int len0as0.length;int len1as1.length;int i0,j0;int[] nextnext(as1);while(ilen0jlen1){if(j-1||as0[i]as1[j]){i;j;}else{jnext[j];}}if(jlen1){return i-j;}return -1;}
}转载于:https://www.cnblogs.com/oversea201405/p/3766892.html
