This example describes the simplest string matching algorithm in PHP. Share to everyone for your reference. The implementation methods are as follows:
Copy Code code as follows:
<?php
/*
The simplest string matching algorithm PHP implementation method
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. Traverse $str String
for ($i =0; $i < $strlen; $i + +) {
if ($i + $searchlen > $strlen) {
echo ' Beyond length ';
}
$match =true;
2. Traverse the string $search to search for a comparison
for ($j =0; $j < $searchlen; $j + +) {
if ($str [$i + $j]!= $search [$j]) {
$match =false;
Break
}
$k = $i + $j;
if ($match) {
if ($j = = $searchlen-1) {
The echo "{$str}" {$i} position starts with {$search}\n;
}
}
}
}
?>
I hope this article will help you with your PHP program design.