Update README_EN.md

Author: yanglbme

solution/3400-3499/3407.Substring Matching Pattern/README_EN.md

@@ -80,7 +80,7 @@ tags:
 
 ### Solution 1: String Matching
 
-According to the problem description, '_' can be replaced by any sequence of zero or more characters, so we can split the pattern string $p$ by `_` into several substrings. If these substrings appear in order in the string $s$, then $p$ can become a substring of $s$.
+According to the problem description, `*` can be replaced by any sequence of zero or more characters, so we can split the pattern string $p$ by `*` into several substrings. If these substrings appear in order in the string $s$, then $p$ can become a substring of $s$.
 
 Therefore, we first initialize a pointer $i$ to the start of string $s$, then iterate over each substring $t$ obtained by splitting the pattern string $p$ by `*`. For each $t$, we search for it in $s$ starting from position $i$. If it is found, we move the pointer $i$ to the end of $t$ and continue searching for the next substring. If it is not found, it means the pattern string $p$ cannot become a substring of $s$, and we return $\text{false}$. If all substrings are found, we return $\text{true}$.