java bm_用java语言实现的bm算法

用java语言实现的bm算法

package com.java.kmp; /*** BM 实现类* */ public class BM { private long time1,time2; private long count; private int dist(char c, char T[]) { int n = T.length; if (c == T[n - 1]) { return n; } for (int i = n; i >= 1; i--) { if (T[i - 1] == c) return n - i; } return n; } public void bm(String msg) { String string2 = ““; String pattern = “123456“; String test = “123“; char[] p = pattern.toCharArray(); char[] t = test.toCharArray(); int plen = p.length, tlen = t.length; int sum = 0; if (plen 0 j--; } if (0 == j) { sum = sum + tlen; string2 = string2 + “ 在主串中第“ + (i + 1) + “位匹配成功 ;“; System.out.println(“在主串中第“ + (i + 1) + “位匹配成功.“); break; } else { sum = sum + k - (i - 1); i = i + dist(p[i - 1], t); if(i > plen){ string2 = string2 + “ 匹配失败 ;“; System.out.println(“匹配失败 .“); break; } } // System.out.println(i); } time2 = System.nanoTime(); }System.out.println(“BM 算法共匹配了 “ + sum + “ 次 .“); System.out.println(“BM 算法开始时间为“ + time1 + “.“); System.out.println(“BM 算法结束时间为“ + time2 + “.“); count = time2 - time1; //string2 = string2 + “\n 所用时间为：“ + count + “ms.\n“; System.out.println(“整个 BM 算法共用时“ + count + “ns.\n“); }public static void main(String[] args) {BM bm = new BM(); bm.bm(); }}