feat: update lc problems (doocs#2654)

yanglbme · web-flow · commit c2b7232efbaf · 2024-04-24T21:04:03.000+08:00
diff --git a/solution/0000-0099/0043.Multiply Strings/README.md b/solution/0000-0099/0043.Multiply Strings/README.md
@@ -288,9 +288,9 @@ class Solution {
                 $product[$i + $j] += $carry;
             }
         }
-        $result = implode("", $product);
+        $result = implode('', $product);
         $result = ltrim($result, '0');
-        return $result === "" ? "0" : $result;
+        return $result === '' ? '0' : $result;
     }
 }
 ```
diff --git a/solution/0000-0099/0043.Multiply Strings/README_EN.md b/solution/0000-0099/0043.Multiply Strings/README_EN.md
@@ -279,9 +279,9 @@ class Solution {
                 $product[$i + $j] += $carry;
             }
         }
-        $result = implode("", $product);
+        $result = implode('', $product);
         $result = ltrim($result, '0');
-        return $result === "" ? "0" : $result;
+        return $result === '' ? '0' : $result;
     }
 }
 ```
diff --git a/solution/0000-0099/0043.Multiply Strings/Solution.php b/solution/0000-0099/0043.Multiply Strings/Solution.php
@@ -22,8 +22,8 @@ function multiply($num1, $num2) {
                 $product[$i + $j] += $carry;
             }
         }
-        $result = implode("", $product);
+        $result = implode('', $product);
         $result = ltrim($result, '0');
-        return $result === "" ? "0" : $result;
+        return $result === '' ? '0' : $result;
     }
-}
+}
diff --git a/solution/0000-0099/0044.Wildcard Matching/README.md b/solution/0000-0099/0044.Wildcard Matching/README.md
@@ -411,7 +411,7 @@ class Solution {
     function isMatch($s, $p) {
         $lengthS = strlen($s);
         $lengthP = strlen($p);
-        $dp = array();
+        $dp = [];
         for ($i = 0; $i <= $lengthS; $i++) {
             $dp[$i] = array_fill(0, $lengthP + 1, false);
         }
@@ -426,7 +426,7 @@ class Solution {
             for ($j = 1; $j <= $lengthP; $j++) {
                 if ($p[$j - 1] == '?' || $s[$i - 1] == $p[$j - 1]) {
                     $dp[$i][$j] = $dp[$i - 1][$j - 1];
-                } else if ($p[$j - 1] == '*') {
+                } elseif ($p[$j - 1] == '*') {
                     $dp[$i][$j] = $dp[$i][$j - 1] || $dp[$i - 1][$j];
                 }
             }
diff --git a/solution/0000-0099/0044.Wildcard Matching/README_EN.md b/solution/0000-0099/0044.Wildcard Matching/README_EN.md
@@ -404,7 +404,7 @@ class Solution {
     function isMatch($s, $p) {
         $lengthS = strlen($s);
         $lengthP = strlen($p);
-        $dp = array();
+        $dp = [];
         for ($i = 0; $i <= $lengthS; $i++) {
             $dp[$i] = array_fill(0, $lengthP + 1, false);
         }
@@ -419,7 +419,7 @@ class Solution {
             for ($j = 1; $j <= $lengthP; $j++) {
                 if ($p[$j - 1] == '?' || $s[$i - 1] == $p[$j - 1]) {
                     $dp[$i][$j] = $dp[$i - 1][$j - 1];
-                } else if ($p[$j - 1] == '*') {
+                } elseif ($p[$j - 1] == '*') {
                     $dp[$i][$j] = $dp[$i][$j - 1] || $dp[$i - 1][$j];
                 }
             }
diff --git a/solution/0000-0099/0044.Wildcard Matching/Solution.php b/solution/0000-0099/0044.Wildcard Matching/Solution.php
@@ -8,7 +8,7 @@ class Solution {
     function isMatch($s, $p) {
         $lengthS = strlen($s);
         $lengthP = strlen($p);
-        $dp = array();
+        $dp = [];
         for ($i = 0; $i <= $lengthS; $i++) {
             $dp[$i] = array_fill(0, $lengthP + 1, false);
         }
@@ -23,11 +23,11 @@ function isMatch($s, $p) {
             for ($j = 1; $j <= $lengthP; $j++) {
                 if ($p[$j - 1] == '?' || $s[$i - 1] == $p[$j - 1]) {
                     $dp[$i][$j] = $dp[$i - 1][$j - 1];
-                } else if ($p[$j - 1] == '*') {
+                } elseif ($p[$j - 1] == '*') {
                     $dp[$i][$j] = $dp[$i][$j - 1] || $dp[$i - 1][$j];
                 }
             }
         }
         return $dp[$lengthS][$lengthP];
     }
-}
+}
diff --git a/solution/3100-3199/3119.Maximum Number of Potholes That Can Be Fixed/README.md b/solution/3100-3199/3119.Maximum Number of Potholes That Can Be Fixed/README.md
@@ -2,7 +2,7 @@
 
 [English Version](/solution/3100-3199/3119.Maximum%20Number%20of%20Potholes%20That%20Can%20Be%20Fixed/README_EN.md)
 
-<!-- tags: -->
+<!-- tags:贪心,字符串,排序 -->
 
 ## 题目描述
 
diff --git a/solution/3100-3199/3119.Maximum Number of Potholes That Can Be Fixed/README_EN.md b/solution/3100-3199/3119.Maximum Number of Potholes That Can Be Fixed/README_EN.md
@@ -2,7 +2,7 @@
 
 [中文文档](/solution/3100-3199/3119.Maximum%20Number%20of%20Potholes%20That%20Can%20Be%20Fixed/README.md)
 
-<!-- tags: -->
+<!-- tags:Greedy,String,Sorting -->
 
 ## Description
 
diff --git a/solution/3100-3199/3120.Count the Number of Special Characters I/README.md b/solution/3100-3199/3120.Count the Number of Special Characters I/README.md
@@ -2,7 +2,7 @@
 
 [English Version](/solution/3100-3199/3120.Count%20the%20Number%20of%20Special%20Characters%20I/README_EN.md)
 
-<!-- tags: -->
+<!-- tags:哈希表,字符串 -->
 
 ## 题目描述
 
diff --git a/solution/3100-3199/3120.Count the Number of Special Characters I/README_EN.md b/solution/3100-3199/3120.Count the Number of Special Characters I/README_EN.md
@@ -2,7 +2,7 @@
 
 [中文文档](/solution/3100-3199/3120.Count%20the%20Number%20of%20Special%20Characters%20I/README.md)
 
-<!-- tags: -->
+<!-- tags:Hash Table,String -->
 
 ## Description
 
diff --git a/solution/3100-3199/3121.Count the Number of Special Characters II/README.md b/solution/3100-3199/3121.Count the Number of Special Characters II/README.md
@@ -2,7 +2,7 @@
 
 [English Version](/solution/3100-3199/3121.Count%20the%20Number%20of%20Special%20Characters%20II/README_EN.md)
 
-<!-- tags: -->
+<!-- tags:哈希表,字符串 -->
 
 ## 题目描述
 
diff --git a/solution/3100-3199/3121.Count the Number of Special Characters II/README_EN.md b/solution/3100-3199/3121.Count the Number of Special Characters II/README_EN.md
@@ -2,7 +2,7 @@
 
 [中文文档](/solution/3100-3199/3121.Count%20the%20Number%20of%20Special%20Characters%20II/README.md)
 
-<!-- tags: -->
+<!-- tags:Hash Table,String -->
 
 ## Description
 
diff --git a/solution/3100-3199/3122.Minimum Number of Operations to Satisfy Conditions/README.md b/solution/3100-3199/3122.Minimum Number of Operations to Satisfy Conditions/README.md
@@ -2,7 +2,7 @@
 
 [English Version](/solution/3100-3199/3122.Minimum%20Number%20of%20Operations%20to%20Satisfy%20Conditions/README_EN.md)
 
-<!-- tags: -->
+<!-- tags:数组,动态规划,矩阵 -->
 
 ## 题目描述
 
diff --git a/solution/3100-3199/3122.Minimum Number of Operations to Satisfy Conditions/README_EN.md b/solution/3100-3199/3122.Minimum Number of Operations to Satisfy Conditions/README_EN.md
@@ -2,7 +2,7 @@
 
 [中文文档](/solution/3100-3199/3122.Minimum%20Number%20of%20Operations%20to%20Satisfy%20Conditions/README.md)
 
-<!-- tags: -->
+<!-- tags:Array,Dynamic Programming,Matrix -->
 
 ## Description
 
diff --git a/solution/3100-3199/3123.Find Edges in Shortest Paths/README.md b/solution/3100-3199/3123.Find Edges in Shortest Paths/README.md
@@ -2,7 +2,7 @@
 
 [English Version](/solution/3100-3199/3123.Find%20Edges%20in%20Shortest%20Paths/README_EN.md)
 
-<!-- tags: -->
+<!-- tags:深度优先搜索,广度优先搜索,图,最短路,堆（优先队列） -->
 
 ## 题目描述
 
diff --git a/solution/3100-3199/3123.Find Edges in Shortest Paths/README_EN.md b/solution/3100-3199/3123.Find Edges in Shortest Paths/README_EN.md
@@ -2,7 +2,7 @@
 
 [中文文档](/solution/3100-3199/3123.Find%20Edges%20in%20Shortest%20Paths/README.md)
 
-<!-- tags: -->
+<!-- tags:Depth-First Search,Breadth-First Search,Graph,Shortest Path,Heap (Priority Queue) -->
 
 ## Description
 
diff --git a/solution/3100-3199/3124.Find Longest Calls/README.md b/solution/3100-3199/3124.Find Longest Calls/README.md
@@ -2,7 +2,7 @@
 
 [English Version](/solution/3100-3199/3124.Find%20Longest%20Calls/README_EN.md)
 
-<!-- tags: -->
+<!-- tags:数据库 -->
 
 ## 题目描述
 
diff --git a/solution/3100-3199/3124.Find Longest Calls/README_EN.md b/solution/3100-3199/3124.Find Longest Calls/README_EN.md
@@ -2,7 +2,7 @@
 
 [中文文档](/solution/3100-3199/3124.Find%20Longest%20Calls/README.md)
 
-<!-- tags: -->
+<!-- tags:Database -->
 
 ## Description
 
diff --git a/solution/DATABASE_README.md b/solution/DATABASE_README.md
@@ -275,7 +275,7 @@
 | 3089 | [查找突发行为](/solution/3000-3099/3089.Find%20Bursty%20Behavior/README.md)                                                                                  | `数据库` | 中等 | 🔒   |
 | 3103 | [查找热门话题标签 II](/solution/3100-3199/3103.Find%20Trending%20Hashtags%20II/README.md)                                                                    | `数据库` | 困难 | 🔒   |
 | 3118 | [Friday Purchase III](/solution/3100-3199/3118.Friday%20Purchase%20III/README.md)                                                                            | `数据库` | 中等 | 🔒   |
-| 3124 | [查找最长的电话](/solution/3100-3199/3124.Find%20Longest%20Calls/README.md)                                                                                  |          | 中等 | 🔒   |
+| 3124 | [查找最长的电话](/solution/3100-3199/3124.Find%20Longest%20Calls/README.md)                                                                                  | `数据库` | 中等 | 🔒   |
 
 ## 版权
 
diff --git a/solution/DATABASE_README_EN.md b/solution/DATABASE_README_EN.md
@@ -273,7 +273,7 @@ Press <kbd>Control</kbd> + <kbd>F</kbd>(or <kbd>Command</kbd> + <kbd>F</kbd> on
 | 3089 | [Find Bursty Behavior](/solution/3000-3099/3089.Find%20Bursty%20Behavior/README_EN.md)                                                                                                       | `Database` | Medium     | 🔒     |
 | 3103 | [Find Trending Hashtags II](/solution/3100-3199/3103.Find%20Trending%20Hashtags%20II/README_EN.md)                                                                                           | `Database` | Hard       | 🔒     |
 | 3118 | [Friday Purchase III](/solution/3100-3199/3118.Friday%20Purchase%20III/README_EN.md)                                                                                                         | `Database` | Medium     | 🔒     |
-| 3124 | [Find Longest Calls](/solution/3100-3199/3124.Find%20Longest%20Calls/README_EN.md)                                                                                                           |            | Medium     | 🔒     |
+| 3124 | [Find Longest Calls](/solution/3100-3199/3124.Find%20Longest%20Calls/README_EN.md)                                                                                                           | `Database` | Medium     | 🔒     |
 
 ## Copyright
 
diff --git a/solution/README.md b/solution/README.md
@@ -3129,12 +3129,12 @@
 |  3116  |  [单面值组合的第 K 小金额](/solution/3100-3199/3116.Kth%20Smallest%20Amount%20With%20Single%20Denomination%20Combination/README.md)  |  `位运算`,`数组`,`数学`,`二分查找`,`组合数学`,`数论`  |  困难  |  第 393 场周赛  |
 |  3117  |  [划分数组得到最小的值之和](/solution/3100-3199/3117.Minimum%20Sum%20of%20Values%20by%20Dividing%20Array/README.md)  |  `位运算`,`线段树`,`队列`,`数组`,`二分查找`,`动态规划`  |  困难  |  第 393 场周赛  |
 |  3118  |  [Friday Purchase III](/solution/3100-3199/3118.Friday%20Purchase%20III/README.md)  |  `数据库`  |  中等  |  🔒  |
-|  3119  |  [Maximum Number of Potholes That Can Be Fixed](/solution/3100-3199/3119.Maximum%20Number%20of%20Potholes%20That%20Can%20Be%20Fixed/README.md)  |    |  中等  |  🔒  |
-|  3120  |  [统计特殊字母的数量 I](/solution/3100-3199/3120.Count%20the%20Number%20of%20Special%20Characters%20I/README.md)  |    |  简单  |  第 394 场周赛  |
-|  3121  |  [统计特殊字母的数量 II](/solution/3100-3199/3121.Count%20the%20Number%20of%20Special%20Characters%20II/README.md)  |    |  中等  |  第 394 场周赛  |
-|  3122  |  [使矩阵满足条件的最少操作次数](/solution/3100-3199/3122.Minimum%20Number%20of%20Operations%20to%20Satisfy%20Conditions/README.md)  |    |  中等  |  第 394 场周赛  |
-|  3123  |  [最短路径中的边](/solution/3100-3199/3123.Find%20Edges%20in%20Shortest%20Paths/README.md)  |    |  困难  |  第 394 场周赛  |
-|  3124  |  [查找最长的电话](/solution/3100-3199/3124.Find%20Longest%20Calls/README.md)  |    |  中等  |  🔒  |
+|  3119  |  [Maximum Number of Potholes That Can Be Fixed](/solution/3100-3199/3119.Maximum%20Number%20of%20Potholes%20That%20Can%20Be%20Fixed/README.md)  |  `贪心`,`字符串`,`排序`  |  中等  |  🔒  |
+|  3120  |  [统计特殊字母的数量 I](/solution/3100-3199/3120.Count%20the%20Number%20of%20Special%20Characters%20I/README.md)  |  `哈希表`,`字符串`  |  简单  |  第 394 场周赛  |
+|  3121  |  [统计特殊字母的数量 II](/solution/3100-3199/3121.Count%20the%20Number%20of%20Special%20Characters%20II/README.md)  |  `哈希表`,`字符串`  |  中等  |  第 394 场周赛  |
+|  3122  |  [使矩阵满足条件的最少操作次数](/solution/3100-3199/3122.Minimum%20Number%20of%20Operations%20to%20Satisfy%20Conditions/README.md)  |  `数组`,`动态规划`,`矩阵`  |  中等  |  第 394 场周赛  |
+|  3123  |  [最短路径中的边](/solution/3100-3199/3123.Find%20Edges%20in%20Shortest%20Paths/README.md)  |  `深度优先搜索`,`广度优先搜索`,`图`,`最短路`,`堆（优先队列）`  |  困难  |  第 394 场周赛  |
+|  3124  |  [查找最长的电话](/solution/3100-3199/3124.Find%20Longest%20Calls/README.md)  |  `数据库`  |  中等  |  🔒  |
 
 ## 版权
 
diff --git a/solution/README_EN.md b/solution/README_EN.md
@@ -3127,12 +3127,12 @@ Press <kbd>Control</kbd> + <kbd>F</kbd>(or <kbd>Command</kbd> + <kbd>F</kbd> on
 |  3116  |  [Kth Smallest Amount With Single Denomination Combination](/solution/3100-3199/3116.Kth%20Smallest%20Amount%20With%20Single%20Denomination%20Combination/README_EN.md)  |  `Bit Manipulation`,`Array`,`Math`,`Binary Search`,`Combinatorics`,`Number Theory`  |  Hard  |  Weekly Contest 393  |
 |  3117  |  [Minimum Sum of Values by Dividing Array](/solution/3100-3199/3117.Minimum%20Sum%20of%20Values%20by%20Dividing%20Array/README_EN.md)  |  `Bit Manipulation`,`Segment Tree`,`Queue`,`Array`,`Binary Search`,`Dynamic Programming`  |  Hard  |  Weekly Contest 393  |
 |  3118  |  [Friday Purchase III](/solution/3100-3199/3118.Friday%20Purchase%20III/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
-|  3119  |  [Maximum Number of Potholes That Can Be Fixed](/solution/3100-3199/3119.Maximum%20Number%20of%20Potholes%20That%20Can%20Be%20Fixed/README_EN.md)  |    |  Medium  |  🔒  |
-|  3120  |  [Count the Number of Special Characters I](/solution/3100-3199/3120.Count%20the%20Number%20of%20Special%20Characters%20I/README_EN.md)  |    |  Easy  |  Weekly Contest 394  |
-|  3121  |  [Count the Number of Special Characters II](/solution/3100-3199/3121.Count%20the%20Number%20of%20Special%20Characters%20II/README_EN.md)  |    |  Medium  |  Weekly Contest 394  |
-|  3122  |  [Minimum Number of Operations to Satisfy Conditions](/solution/3100-3199/3122.Minimum%20Number%20of%20Operations%20to%20Satisfy%20Conditions/README_EN.md)  |    |  Medium  |  Weekly Contest 394  |
-|  3123  |  [Find Edges in Shortest Paths](/solution/3100-3199/3123.Find%20Edges%20in%20Shortest%20Paths/README_EN.md)  |    |  Hard  |  Weekly Contest 394  |
-|  3124  |  [Find Longest Calls](/solution/3100-3199/3124.Find%20Longest%20Calls/README_EN.md)  |    |  Medium  |  🔒  |
+|  3119  |  [Maximum Number of Potholes That Can Be Fixed](/solution/3100-3199/3119.Maximum%20Number%20of%20Potholes%20That%20Can%20Be%20Fixed/README_EN.md)  |  `Greedy`,`String`,`Sorting`  |  Medium  |  🔒  |
+|  3120  |  [Count the Number of Special Characters I](/solution/3100-3199/3120.Count%20the%20Number%20of%20Special%20Characters%20I/README_EN.md)  |  `Hash Table`,`String`  |  Easy  |  Weekly Contest 394  |
+|  3121  |  [Count the Number of Special Characters II](/solution/3100-3199/3121.Count%20the%20Number%20of%20Special%20Characters%20II/README_EN.md)  |  `Hash Table`,`String`  |  Medium  |  Weekly Contest 394  |
+|  3122  |  [Minimum Number of Operations to Satisfy Conditions](/solution/3100-3199/3122.Minimum%20Number%20of%20Operations%20to%20Satisfy%20Conditions/README_EN.md)  |  `Array`,`Dynamic Programming`,`Matrix`  |  Medium  |  Weekly Contest 394  |
+|  3123  |  [Find Edges in Shortest Paths](/solution/3100-3199/3123.Find%20Edges%20in%20Shortest%20Paths/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Graph`,`Shortest Path`,`Heap (Priority Queue)`  |  Hard  |  Weekly Contest 394  |
+|  3124  |  [Find Longest Calls](/solution/3100-3199/3124.Find%20Longest%20Calls/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
 
 ## Copyright
 

Original file line number	Diff line number	Diff line change
`@@ -288,9 +288,9 @@ class Solution {`
`288`	`288`	`$product[$i + $j] += $carry;`
`289`	`289`	`}`
`290`	`290`	`}`
`291`		`- $result = implode("", $product);`
	`291`	`+ $result = implode('', $product);`
`292`	`292`	`$result = ltrim($result, '0');`
`293`		`- return $result === "" ? "0" : $result;`
	`293`	`+ return $result === '' ? '0' : $result;`
`294`	`294`	`}`
`295`	`295`	`}`
`296`	`296`	```
Original file line number	Diff line number	Diff line change
`@@ -279,9 +279,9 @@ class Solution {`
`279`	`279`	`$product[$i + $j] += $carry;`
`280`	`280`	`}`
`281`	`281`	`}`
`282`		`- $result = implode("", $product);`
	`282`	`+ $result = implode('', $product);`
`283`	`283`	`$result = ltrim($result, '0');`
`284`		`- return $result === "" ? "0" : $result;`
	`284`	`+ return $result === '' ? '0' : $result;`
`285`	`285`	`}`
`286`	`286`	`}`
`287`	`287`	```
Original file line number	Diff line number	Diff line change
`@@ -22,8 +22,8 @@ function multiply($num1, $num2) {`
`22`	`22`	`$product[$i + $j] += $carry;`
`23`	`23`	`}`
`24`	`24`	`}`
`25`		`- $result = implode("", $product);`
	`25`	`+ $result = implode('', $product);`
`26`	`26`	`$result = ltrim($result, '0');`
`27`		`- return $result === "" ? "0" : $result;`
	`27`	`+ return $result === '' ? '0' : $result;`
`28`	`28`	`}`
`29`		`-}`
	`29`	`+}`
Original file line number	Diff line number	Diff line change
`@@ -411,7 +411,7 @@ class Solution {`
`411`	`411`	`function isMatch($s, $p) {`
`412`	`412`	`$lengthS = strlen($s);`
`413`	`413`	`$lengthP = strlen($p);`
`414`		`- $dp = array();`
	`414`	`+ $dp = [];`
`415`	`415`	`for ($i = 0; $i <= $lengthS; $i++) {`
`416`	`416`	`$dp[$i] = array_fill(0, $lengthP + 1, false);`
`417`	`417`	`}`
`@@ -426,7 +426,7 @@ class Solution {`
`426`	`426`	`for ($j = 1; $j <= $lengthP; $j++) {`
`427`	`427`	`if ($p[$j - 1] == '?' \|\| $s[$i - 1] == $p[$j - 1]) {`
`428`	`428`	`$dp[$i][$j] = $dp[$i - 1][$j - 1];`
`429`		`- } else if ($p[$j - 1] == '*') {`
	`429`	`+ } elseif ($p[$j - 1] == '*') {`
`430`	`430`	`$dp[$i][$j] = $dp[$i][$j - 1] \|\| $dp[$i - 1][$j];`
`431`	`431`	`}`
`432`	`432`	`}`
Original file line number	Diff line number	Diff line change
`@@ -404,7 +404,7 @@ class Solution {`
`404`	`404`	`function isMatch($s, $p) {`
`405`	`405`	`$lengthS = strlen($s);`
`406`	`406`	`$lengthP = strlen($p);`
`407`		`- $dp = array();`
	`407`	`+ $dp = [];`
`408`	`408`	`for ($i = 0; $i <= $lengthS; $i++) {`
`409`	`409`	`$dp[$i] = array_fill(0, $lengthP + 1, false);`
`410`	`410`	`}`
`@@ -419,7 +419,7 @@ class Solution {`
`419`	`419`	`for ($j = 1; $j <= $lengthP; $j++) {`
`420`	`420`	`if ($p[$j - 1] == '?' \|\| $s[$i - 1] == $p[$j - 1]) {`
`421`	`421`	`$dp[$i][$j] = $dp[$i - 1][$j - 1];`
`422`		`- } else if ($p[$j - 1] == '*') {`
	`422`	`+ } elseif ($p[$j - 1] == '*') {`
`423`	`423`	`$dp[$i][$j] = $dp[$i][$j - 1] \|\| $dp[$i - 1][$j];`
`424`	`424`	`}`
`425`	`425`	`}`
Original file line number	Diff line number	Diff line change
`@@ -8,7 +8,7 @@ class Solution {`
`8`	`8`	`function isMatch($s, $p) {`
`9`	`9`	`$lengthS = strlen($s);`
`10`	`10`	`$lengthP = strlen($p);`
`11`		`- $dp = array();`
	`11`	`+ $dp = [];`
`12`	`12`	`for ($i = 0; $i <= $lengthS; $i++) {`
`13`	`13`	`$dp[$i] = array_fill(0, $lengthP + 1, false);`
`14`	`14`	`}`
`@@ -23,11 +23,11 @@ function isMatch($s, $p) {`
`23`	`23`	`for ($j = 1; $j <= $lengthP; $j++) {`
`24`	`24`	`if ($p[$j - 1] == '?' \|\| $s[$i - 1] == $p[$j - 1]) {`
`25`	`25`	`$dp[$i][$j] = $dp[$i - 1][$j - 1];`
`26`		`- } else if ($p[$j - 1] == '*') {`
	`26`	`+ } elseif ($p[$j - 1] == '*') {`
`27`	`27`	`$dp[$i][$j] = $dp[$i][$j - 1] \|\| $dp[$i - 1][$j];`
`28`	`28`	`}`
`29`	`29`	`}`
`30`	`30`	`}`
`31`	`31`	`return $dp[$lengthS][$lengthP];`
`32`	`32`	`}`
`33`		`-}`
	`33`	`+}`