feat: add php solution to lc problem: No.0229 (doocs#964)

Author: Qiu-IT

solution/0200-0299/0229.Majority Element II/README.md

@@ -230,6 +230,27 @@ public class Solution {
 }
 ```
 
+### **PHP**
+
+```php
+class Solution {
+    /**
+     * @param Integer[] $nums
+     * @return Integer[]
+     */
+    function majorityElement($nums) {
+        $rs = [];
+        $n = count($nums);
+        for ($i = 0; $i < $n; $i++) {
+            $hashmap[$nums[$i]] += 1;
+            if ($hashmap[$nums[$i]] > $n / 3)
+                array_push($rs, $nums[$i]);
+        }
+        return array_unique($rs);
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0200-0299/0229.Majority Element II/README_EN.md

@@ -219,6 +219,27 @@ public class Solution {
 }
 ```
 
+### **PHP**
+
+```php
+class Solution {
+    /**
+     * @param Integer[] $nums
+     * @return Integer[]
+     */
+    function majorityElement($nums) {
+        $rs = [];
+        $n = count($nums);
+        for ($i = 0; $i < $n; $i++) {
+            $hashmap[$nums[$i]] += 1;
+            if ($hashmap[$nums[$i]] > $n / 3)
+                array_push($rs, $nums[$i]);
+        }
+        return array_unique($rs);
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0200-0299/0229.Majority Element II/Solution.php

@@ -0,0 +1,16 @@
+class Solution {
+    /**
+     * @param Integer[] $nums
+     * @return Integer[]
+     */
+    function majorityElement($nums) {
+        $rs = [];
+        $n = count($nums);
+        for ($i = 0; $i < $n; $i++) {
+            $hashmap[$nums[$i]] += 1;
+            if ($hashmap[$nums[$i]] > $n / 3)
+                array_push($rs, $nums[$i]);
+        }
+        return array_unique($rs);
+    }
+}