feat: add php solutions to lc problem: No.0001 (doocs#896)

No.0001.Two Sum

Author: Qiu-IT

solution/0000-0099/0001.Two Sum/README.md

@@ -230,7 +230,29 @@ proc twoSum(nums: seq[int], target: int): seq[int] =
             tdx = nums.find(bal)
             if idx != tdx:
                 return @[idx, tdx]
+```
+
+### **PHP**
+
+```php
+class Solution {
 
+    /**
+     * @param Integer[] $nums
+     * @param Integer $target
+     * @return Integer[]
+     */
+    function twoSum($nums, $target) {
+        $len = count($nums);
+        for ($i = 0; $i < $len; $i++) {
+            for ($j = 1 + $i; $j < $len; $j++) {
+                if ($nums[$i] + $nums[$j] == $target) {
+                    return [$i, $j];
+                }
+            }
+        }
+    }
+}
 ```
 
 ### **...**

solution/0000-0099/0001.Two Sum/README_EN.md

@@ -211,7 +211,29 @@ proc twoSum(nums: seq[int], target: int): seq[int] =
             tdx = nums.find(bal)
             if idx != tdx:
                 return @[idx, tdx]
+```
+
+### **PHP**
+
+```php
+class Solution {
 
+    /**
+     * @param Integer[] $nums
+     * @param Integer $target
+     * @return Integer[]
+     */
+    function twoSum($nums, $target) {
+        $len = count($nums);
+        for ($i = 0; $i < $len; $i++) {
+            for ($j = 1 + $i; $j < $len; $j++) {
+                if ($nums[$i] + $nums[$j] == $target) {
+                    return [$i, $j];
+                }
+            }
+        }
+    }
+}
 ```
 
 ### **...**

solution/0000-0099/0001.Two Sum/Solution.php

@@ -0,0 +1,18 @@
+class Solution {
+
+    /**
+     * @param Integer[] $nums
+     * @param Integer $target
+     * @return Integer[]
+     */
+    function twoSum($nums, $target) {
+        $len = count($nums);
+        for ($i = 0; $i < $len; $i++) {
+            for ($j = 1 + $i; $j < $len; $j++) {
+                if ($nums[$i] + $nums[$j] == $target) {
+                    return [$i, $j];
+                }
+            }
+        }
+    }
+}