KMP算法

跟马拉车算法其实有点异曲同工。

package KMP;

public class KMP_Test {
	public static void main(String[] args) {
		String ts = "DFabc";
		String ps = "ab";
		int l = KMP(ts, ps);
		System.out.println(l);
	}
	public static int KMP(String ts, String ps) {
		char[] t = ts.toCharArray();
		char[] p = ps.toCharArray();
		
		int i = 0;
		int j = 0;
		int[] next = getNext(ps);
		while(i < t.length && j < p.length) {
			if(j == -1 || t[i] == p[j]) {
				i++;
				j++;
			}else {
				j = next[j];
			}
		}
		if(j == p.length) {
			return i - j;
		}else {
			return -1;
		}
	}

	private static int[] getNext(String ps) {
		// TODO 自动生成的方法存根
		char[] p =ps.toCharArray();
		int[] next = new int[p.length];
		next[0] = -1;
		int j = 0;
		int k = -1;
		while(j < p.length - 1) {
			if(k == -1 || p[j] == p[k]) {
				next[++j] = ++k;
			}else {
				k = next[k];
			}
		}
		return next;
	}
}