PHP KMP算法实现

function getNext($string) {
	$next[0] = 0;
	$j = 1;
	$k = 0;
	$strlen = strlen($string);
	while($j < $strlen){
		if($string[$k] != $string[$j]) {
			if($k == 0) {
				$next[$j] = 0;
				$j++;	
			} else {
				$k = $next[$k-1];
			}
		}else{
			$k++;
			$next[$j] = $k;
			$j++;
		}
	}
	
	return $next;
}


function kmpSearch($string, $pattern) {
	$len1 = strlen($string);
	$len2 = strlen($pattern);
	$next = getNext($pattern);

	$i = 0;
	$j = 0;
	while($i < $len1){
		if($string[$i] != $pattern[$j]) {
			if($j == 0) {
				$i++;
			}else{
				$j = $next[$j-1];
			}
		}else{
			$i++;
			$j++;
		}
		
		if($j == $len2 ){
			echo '子串出现位置：'.($i - $j) .'<br/>';
			$j = $next[$j-1]; //匹配出pattern在string中全部出现位置
		}
	}
}