Implement strStr().
Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
方法见上一篇博客http://blog.csdn.net/ysyyork/article/details/40811203
Rabin-Kary Algorithm实现如下:
public int strStr(String haystack, String needle) {
int n = haystack.length();
int m = needle.length();
if (n < m)
return -1;
if (m == 0)
return 0;
if (n == 0)
return -1;
int B = 3;
int M = 9973;
//calculate the hash value of the needle(pattern)
int hp = 0;
for (int i = 0; i < m; i++) {
hp = intMod(hp * B + (int)needle.charAt(i), M);
}
//calculate the first segment of the haystack(text) of length m
int ht = 0;
for (int i = 0; i < m; i++){
ht = intMod(ht * B + (int)haystack.charAt(i), M);
}
//check whether the first segment is exactly the needle
if (ht == hp) {
for (int i = 0; i < m; i++) {
if (haystack.charAt(i) != needle.charAt(i)) {
return -1;
}
}
return 0;
}
for (int i = m; i < n; i++) {
ht = intMod(ht - intMod((int)haystack.charAt(i - m) * intMod((int)Math.pow(B, m - 1), M), M), M);
ht = intMod(ht * B, M);
ht = intMod(ht + (int)haystack.charAt(i), M);
if (ht == hp) {
for (int j = i; j > i - m; j--) {
if (haystack.charAt(j) != needle.charAt(m - 1 - (i - j))) {
return -1;
}
}
return i - m + 1;
}
}
return -1;
}
//Used to prevent negative module
public int intMod(int a, int b) {
return (a % b + b) % b;
}