<?php
/*
最簡(jiǎn)單字符串匹配算法php實(shí)現(xiàn)方式
?
T: ababcabc
P: abc
?
0.????????? 1.????????? 2.
ababcabc??? ababcabc??? ababcabc
|||????????? |||????????? |||
abc????????? abc????????? abc
(X)????????? (X)????????? (O)
?
3.????????? 4.????????? 5.
ababcabc??? ababcabc??? ababcabc
???
|||????????? |||????????? |||
???
abc????????? abc????????? abc
???
(X)????????? (X)????????? (O)
*/
?
$str="ababcabc";
$search="abc";
?
$strlen=strlen($str);
$searchlen=strlen($search);
?
//1.遍歷$str字符串
for($i=0;$i<$strlen;$i++){
??? if($i+$searchlen>$strlen){
??????? echo '超出長(zhǎng)度';break;
??? }
?
??? $match=true;
?
????
//2.遍歷要搜索的字符串$search,進(jìn)行對(duì)比
??? for($j=0;$j<$searchlen;$j++){
?
??????? if($str[$i+$j]!=$search[$j]){
??????????? $match=false;
??????????? break;
??????? }
??????? $k=$i+$j;
??????? if($match){
??????????? if($j==$searchlen-1){
??????????????? echo "{$str}第{$i}個(gè)位置開(kāi)始為{$search}＼n";break;
??????????? }
??????? }
??? }
}
?>