feat: add php solution lc problem: No.0485 (doocs#974)

Author: Qiu-IT

solution/0400-0499/0485.Max Consecutive Ones/README.md

@@ -188,6 +188,28 @@ impl Solution {
 }
 ```
 
+### **PHP**
+
+```php
+class Solution {
+    /**
+     * @param Integer[] $nums
+     * @return Integer
+     */
+    function findMaxConsecutiveOnes($nums) {
+        $tmp = $max = 0;
+        for ($i = 0; $i < count($nums); $i++) {
+            if ($nums[$i] == 1) $tmp++;
+            else {
+                $max = max($tmp, $max);
+                $tmp = 0;
+            }
+        }
+        return max($tmp, $max);
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0400-0499/0485.Max Consecutive Ones/README_EN.md

@@ -172,6 +172,28 @@ impl Solution {
 }
 ```
 
+### **PHP**
+
+```php
+class Solution {
+    /**
+     * @param Integer[] $nums
+     * @return Integer
+     */
+    function findMaxConsecutiveOnes($nums) {
+        $tmp = $max = 0;
+        for ($i = 0; $i < count($nums); $i++) {
+            if ($nums[$i] == 1) $tmp++;
+            else {
+                $max = max($tmp, $max);
+                $tmp = 0;
+            }
+        }
+        return max($tmp, $max);
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0400-0499/0485.Max Consecutive Ones/Solution.php

@@ -0,0 +1,17 @@
+class Solution {
+    /**
+     * @param Integer[] $nums
+     * @return Integer
+     */
+    function findMaxConsecutiveOnes($nums) {
+        $tmp = $max = 0;
+        for ($i = 0; $i < count($nums); $i++) {
+            if ($nums[$i] == 1) $tmp++;
+            else {
+                $max = max($tmp, $max);
+                $tmp = 0;
+            }
+        }
+        return max($tmp, $max);
+    }
+}