feat: add php solution to lc problem: No.1672 (doocs#984)

Author: Qiu-IT

solution/1600-1699/1672.Richest Customer Wealth/README.md

@@ -189,6 +189,27 @@ class Solution {
 }
 ```
 
+### **PHP**
+
+```php
+class Solution {
+    /**
+     * @param Integer[][] $accounts
+     * @return Integer
+     */
+    function maximumWealth($accounts) {
+        $rs = 0;
+        for ($i = 0; $i < count($accounts); $i++) {
+            $sum = 0;
+            for ($j = 0; $j < count($accounts[$i]); $j++)
+                $sum += $accounts[$i][$j];
+            if ($sum > $rs) $rs = $sum;
+        }
+        return $rs;
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1600-1699/1672.Richest Customer Wealth/README_EN.md

@@ -176,6 +176,27 @@ class Solution {
 }
 ```
 
+### **PHP**
+
+```php
+class Solution {
+    /**
+     * @param Integer[][] $accounts
+     * @return Integer
+     */
+    function maximumWealth($accounts) {
+        $rs = 0;
+        for ($i = 0; $i < count($accounts); $i++) {
+            $sum = 0;
+            for ($j = 0; $j < count($accounts[$i]); $j++)
+                $sum += $accounts[$i][$j];
+            if ($sum > $rs) $rs = $sum;
+        }
+        return $rs;
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1600-1699/1672.Richest Customer Wealth/Solution.php

@@ -0,0 +1,16 @@
+class Solution {
+    /**
+     * @param Integer[][] $accounts
+     * @return Integer
+     */
+    function maximumWealth($accounts) {
+        $rs = 0;
+        for ($i = 0; $i < count($accounts); $i++) {
+            $sum = 0;
+            for ($j = 0; $j < count($accounts[$i]); $j++)
+                $sum += $accounts[$i][$j];
+            if ($sum > $rs) $rs = $sum;
+        }
+        return $rs;
+    }
+}