feat: add php solution to lc problem: No.0238

solution/0200-0299/0238.Product of Array Except Self/README.md

@@ -229,6 +229,30 @@ public class Solution {
 }
 ```
 
+### **PHP**
+
+```php
+class Solution {
+    /**
+     * @param Integer[] $nums
+     * @return Integer[]
+     */
+    function productExceptSelf($nums) {
+        $n = count($nums);
+        $ans = [];
+        for ($i = 0, $left = 1; $i < $n; ++$i) {
+            $ans[$i] = $left;
+            $left *= $nums[$i];
+        }
+        for ($i = $n - 1, $right = 1; $i >= 0; --$i) {
+            $ans[$i] *= $right;
+            $right *= $nums[$i];
+        }
+        return $ans;
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0200-0299/0238.Product of Array Except Self/README_EN.md

@@ -211,6 +211,30 @@ public class Solution {
 }
 ```
 
+### **PHP**
+
+```php
+class Solution {
+    /**
+     * @param Integer[] $nums
+     * @return Integer[]
+     */
+    function productExceptSelf($nums) {
+        $n = count($nums);
+        $ans = [];
+        for ($i = 0, $left = 1; $i < $n; ++$i) {
+            $ans[$i] = $left;
+            $left *= $nums[$i];
+        }
+        for ($i = $n - 1, $right = 1; $i >= 0; --$i) {
+            $ans[$i] *= $right;
+            $right *= $nums[$i];
+        }
+        return $ans;
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0200-0299/0238.Product of Array Except Self/Solution.php

@@ -0,0 +1,19 @@
+class Solution {
+    /**
+     * @param Integer[] $nums
+     * @return Integer[]
+     */
+    function productExceptSelf($nums) {
+        $n = count($nums);
+        $ans = [];
+        for ($i = 0, $left = 1; $i < $n; ++$i) {
+            $ans[$i] = $left;
+            $left *= $nums[$i];
+        }
+        for ($i = $n - 1, $right = 1; $i >= 0; --$i) {
+            $ans[$i] *= $right;
+            $right *= $nums[$i];
+        }
+        return $ans;
+    }
+}