feat: add php solution to lcci problem: No.16.17 (doocs#997)

Qiu-IT · web-flow · commit 32cbb4f037f9 · 2023-04-26T17:44:06.000+08:00
diff --git a/lcci/16.17.Contiguous Sequence/README.md b/lcci/16.17.Contiguous Sequence/README.md
@@ -193,10 +193,29 @@ var maxSubArray = function (nums) {
 };
 ```
 
-### **...**
+### **PHP**
 
+```php
+class Solution {
+    /**
+     * @param Integer[] $nums
+     * @return Integer
+     */
+    function maxSubArray($nums) {
+        $pre = 0;
+        $max = $nums[0];
+        for ($i = 0; $i < count($nums); $i++) {
+            $pre = max($pre + $nums[$i], $nums[$i]);
+            $max = max($pre, $max);
+        }
+        return $max;
+    }
+}
 ```
 
+### **...**
+
+```
 
 ```
 
diff --git a/lcci/16.17.Contiguous Sequence/README_EN.md b/lcci/16.17.Contiguous Sequence/README_EN.md
@@ -201,10 +201,29 @@ var maxSubArray = function (nums) {
 };
 ```
 
-### **...**
+### **PHP**
 
+```php
+class Solution {
+    /**
+     * @param Integer[] $nums
+     * @return Integer
+     */
+    function maxSubArray($nums) {
+        $pre = 0;
+        $max = $nums[0];
+        for ($i = 0; $i < count($nums); $i++) {
+            $pre = max($pre + $nums[$i], $nums[$i]);
+            $max = max($pre, $max);
+        }
+        return $max;
+    }
+}
 ```
 
+### **...**
+
+```
 
 ```
 
diff --git a/lcci/16.17.Contiguous Sequence/Solution.php b/lcci/16.17.Contiguous Sequence/Solution.php
@@ -0,0 +1,15 @@
+class Solution {
+    /**
+     * @param Integer[] $nums
+     * @return Integer
+     */
+    function maxSubArray($nums) {
+        $pre = 0;
+        $max = $nums[0];
+        for ($i = 0; $i < count($nums); $i++) {
+            $pre = max($pre + $nums[$i], $nums[$i]);
+            $max = max($pre, $max);
+        }
+        return $max;
+    }
+}
