字符串算法之kmp（未完成）

	public static int strStrKMP(String s, String p) {
		
		int[] next = new int[p.length()];
		getNext(next, p);
		int i = 0, j = 0;
		while (i < s.length() && j < p.length()) {
			if (j == -1 || s.charAt(i) == p.charAt(j)) {
				i++;
				j++;
			} else {
				j = next[j];
			}
		}
		
		return j == p.length() ? i - j : -1;
	}
	
	public static void getNext(int[] next, String p) {
		int k = -1;
		int j = 0;
		next[0] = -1;
		while (j < p.length() - 1) {
			if (k == -1 || p.charAt(j) == p.charAt(k)) {
				j++;
				k++;
				if (p.charAt(j) != p.charAt(k)) {
					next[j] = k;
				} else {
					next[j] = next[k];
				}
			} else {
				k = next[k];
			}
		}
	}

http://blog.youkuaiyun.com/v_july_v/article/details/7041827