


PHP algorithm: PHP implements the problem of the longest common substring
What this article brings to you is the problem of the longest common substring in PHP implementation of the PHP algorithm. It has certain reference value. Friends in need can refer to it. I hope it will be helpful to you.
Longest common substring problem:
Given two strings, find the length of the longest identical substring between them.
Violent solution ideas:
1. Start with each character of the two strings and compare them later, which will require two levels of loops
2. The comparison method inside the two-level loop is also a one-level loop, starting from the current character, traversing and comparing until there is a difference, then jump out of the loop and record the length of the same substring
3. Based on the longest length, there are three levels of loops. Time complexity O(n^3)
longest=0 for i=0;i<str1.size;i++ for j=0;j<str2.size;j++ m=i n=j length=0 while(m<str1.size && n<str2.size) if str1[m]!=str2[n] break ++length ++m ++n longest=longest<length ? length:longest
Dynamic programming method:
1. In the above comparison process, starting from i and j, if After reaching a different stop, the next starting position will be compared repeatedly
2. Dynamic programming method-space for time, matrix graph, can reduce the complexity to O(n^2)
3.str1 is the horizontal axis, str2 is the vertical axis, table[i][j] is the length of the longest substring ending with these two characters
4.table[0][j] It can be deduced, if str1[0]==str2[j] is 1, table[i][0] can be deduced, if str1[i]==str2[0] is 1, and the rest is 0
5.table[i][j] If str1[i]==str2[j] can be obtained from table[i-1][j-1] 1, if not equal to 0
Assume that the two strings are s and t respectively, s[i] and t[j] represent the i-th and j-th characters respectively (the character order starts from 0), and then let L[i, j] represent s[ i] and s[j] are the maximum length of the same substring at the end. It should not be difficult to derive the relationship between L[i, j] and L[i 1,j 1], because the only difference between the two is the pair of characters s[i 1] and t[j 1]. If s[i 1] and t[j 1] are different, then L[i 1, j 1] should naturally be 0, because any substring ending with them cannot be exactly the same; and if s[i 1] The same as t[j 1], then just add these two characters after the longest identical substring ending with s[i] and t[j], so that the length can be increased by one. Combining the above two situations, we get the relationship L[i 1,j 1]=(s[i]==t[j]?L[i,j] 1:0).
Code example:
<?php $str1="abcdef"; $str2="esdfdbcde1"; //暴力解法 function longestCommonSubstring1($str1,$str2){ $longest=0; $size1=strlen($str1); $size2=strlen($str2); for($i=0;$i<$size1;$i++){ for($j=0;$j<$size2;$j++){ $m=$i; $n=$j; $length=0; while($m<$size1 && $n<$size2){ if($str1[$m]!=$str2[$n]) break; ++$length; ++$m; ++$n; } $longest=$longest < $length ? $length : $longest; } } return $longest; } //矩阵动态规划法 function longestCommonSubstring2($str1,$str2){ $size1=strlen($str1); $size2=strlen($str2); $table=array(); for($i=0;$i<$size1;$i++){ $table[$i][0]=$str1[$i]==$str2[0] ? 1:0; } for($j=0;$j<$size2;$j++){ $table[0][$j]=$str1[0]==$str2[$j] ? 1:0; } for($i=1;$i<$size1;$i++){ for($j=1;$j<$size2;$j++){ if($str1[$i]==$str2[$j]){ $table[$i][$j]=$table[$i-1][$j-1]+1; }else{ $table[$i][$j]=0; } } } $longest=0; for($i=0;$i<$size1;$i++){ for($j=0;$j<$size2;$j++){ $longest=$longest<$table[$i][$j] ? $table[$i][$j] : $longest; }} return $longest; } $len=longestCommonSubstring1($str1,$str2); $len=longestCommonSubstring2($str1,$str2); var_dump($len);
The above is the entire content of this article. For more related tutorials, please visit php programming from entry to master full set of video tutorials, php practical video tutorial, bootstrap video tutorial!
The above is the detailed content of PHP algorithm: PHP implements the problem of the longest common substring. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

AI Hentai Generator
Generate AI Hentai for free.

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics



PHP 8.4 brings several new features, security improvements, and performance improvements with healthy amounts of feature deprecations and removals. This guide explains how to install PHP 8.4 or upgrade to PHP 8.4 on Ubuntu, Debian, or their derivati

Visual Studio Code, also known as VS Code, is a free source code editor — or integrated development environment (IDE) — available for all major operating systems. With a large collection of extensions for many programming languages, VS Code can be c

If you are an experienced PHP developer, you might have the feeling that you’ve been there and done that already.You have developed a significant number of applications, debugged millions of lines of code, and tweaked a bunch of scripts to achieve op

This tutorial demonstrates how to efficiently process XML documents using PHP. XML (eXtensible Markup Language) is a versatile text-based markup language designed for both human readability and machine parsing. It's commonly used for data storage an

JWT is an open standard based on JSON, used to securely transmit information between parties, mainly for identity authentication and information exchange. 1. JWT consists of three parts: Header, Payload and Signature. 2. The working principle of JWT includes three steps: generating JWT, verifying JWT and parsing Payload. 3. When using JWT for authentication in PHP, JWT can be generated and verified, and user role and permission information can be included in advanced usage. 4. Common errors include signature verification failure, token expiration, and payload oversized. Debugging skills include using debugging tools and logging. 5. Performance optimization and best practices include using appropriate signature algorithms, setting validity periods reasonably,

A string is a sequence of characters, including letters, numbers, and symbols. This tutorial will learn how to calculate the number of vowels in a given string in PHP using different methods. The vowels in English are a, e, i, o, u, and they can be uppercase or lowercase. What is a vowel? Vowels are alphabetic characters that represent a specific pronunciation. There are five vowels in English, including uppercase and lowercase: a, e, i, o, u Example 1 Input: String = "Tutorialspoint" Output: 6 explain The vowels in the string "Tutorialspoint" are u, o, i, a, o, i. There are 6 yuan in total

Static binding (static::) implements late static binding (LSB) in PHP, allowing calling classes to be referenced in static contexts rather than defining classes. 1) The parsing process is performed at runtime, 2) Look up the call class in the inheritance relationship, 3) It may bring performance overhead.

What are the magic methods of PHP? PHP's magic methods include: 1.\_\_construct, used to initialize objects; 2.\_\_destruct, used to clean up resources; 3.\_\_call, handle non-existent method calls; 4.\_\_get, implement dynamic attribute access; 5.\_\_set, implement dynamic attribute settings. These methods are automatically called in certain situations, improving code flexibility and efficiency.
