RK算法
public class RabinKarp {
public static int rabinKarp(String str, String pattern) {
//主串长度
int m = str.length();
//模式串的长度
int n = pattern.length();
//计算模式串的hash值
int patternCode = hash(pattern);
//计算主串当中第一个和模式串等长的子串hash值
int strCode = hash(str.substring(0, n));
//用模式串的hash值和主串的局部hash值比较。
//如果匹配,则进行精确比较;如果不匹配,计算主串中相邻子串的hash值。
for (int i = 0; i < (m - n + 1); i++) {
if ((strCode == patternCode) && compareString(i, str, pattern)) {
return i;
}
//如果不是最后一轮,更新主串从i到i+n的hash值
if (i < (m - n)) {
strCode = nextHash(str, strCode, i, n);
}
}
return -1;
}
private static int hash(String str) {
int hashcode = 0;
//这里采用最简单的hashcode计算方式:
//把a当做1,把b当中2,把c当中3.....然后按位相加
for (int i = 0; i < str.length(); i++) {
hashcode += (str.charAt(i) - 'a');
}
return hashcode;
}
private static int nextHash(String str, int hash, int index, int n) {
hash -= (str.charAt(index) - 'a');
hash += (str.charAt(index + n) - 'a');
return hash;
}
private static boolean compareString(int i, String str, String pattern) {
String strSub = str.substring(i, i + pattern.length());
return strSub.equals(pattern);
}
public static void main(String[] args) {
String str = "aacdesadsdfer";
String pattern = "adsd";
System.out.println("第一次出现的位置:" + rabinKarp(str, pattern));
}
}
KMP算法
public class KMP {
// KMP算法主体逻辑。str是主串,pattern是模式串
public static int kmp(String str, String pattern) {
//预处理,生成next数组
int[] next = getNexts(pattern);
int j = 0;
//主循环,遍历主串字符
for (int i = 0; i < str.length(); i++) {
while ((j > 0) && (str.charAt(i) != pattern.charAt(j))) {
//遇到坏字符时,查询next数组并改变模式串的起点
j = next[j];
}
if (str.charAt(i) == pattern.charAt(j)) {
j++;
}
if (j == pattern.length()) {
//匹配成功,返回下标
return i - pattern.length() + 1;
}
}
return -1;
}
// 生成Next数组
private static int[] getNexts(String pattern) {
int[] next = new int[pattern.length()];
int j = 0;
for (int i = 2; i < pattern.length(); i++) {
while ((j != 0) && (pattern.charAt(j) != pattern.charAt(i - 1))) {
//从next[i+1]的求解回溯到 next[j]
j = next[j];
}
if (pattern.charAt(j) == pattern.charAt(i - 1)) {
j++;
}
next[i] = j;
}
return next;
}
public static void main(String[] args) {
String str = "ATGTGAGCTGGTGTGTGCFAA";
String pattern = "GTGTGCF";
int index = kmp(str, pattern);
System.out.println("首次出现位置:" + index);
}
}