算法_KMP_字符串子串出现个数

KMP

public class KMP {
   

	public static void main(String[] args) {
   

		String source = "abccdfabvsfnabc";
		String dest = "ab";
		int[] next = kmpNext(dest);
		System.out.println(kmp(source, dest, next));
	}

	/**
	 * kmp求子串出现的次数
	 * @param source
	 * @param dest
	 * @param next
	 * @return
	 */
	public static int kmp(String source, String dest, int[] next) {
   
		int count = 0;
		for (int i