feat: add php solution to lc problem: No.1100 (#1105)

Author: Qiu-IT

solution/1100-1199/1100.Find K-Length Substrings With No Repeated Characters/README.md

@@ -264,6 +264,33 @@ function numKLenSubstrNoRepeats(s: string, k: number): number {
 }
 ```
 
+### **PHP**
+
+```php
+class Solution {
+    /**
+     * @param String $s
+     * @param Integer $k
+     * @return Integer
+     */
+    function numKLenSubstrNoRepeats($s, $k) {
+        $sum = ($k * ($k + 1)) / 2 - $k;
+        $cnt = $tmp = 0;
+        for ($i = 0; $i < strlen($s) - $k + 1; $i++) {
+            $str = substr($s, $i, $k);
+            for ($j = 0; $j < $k; $j++) {
+                $tmp += strpos($str, $str[$j]);
+            }
+            if ($tmp === $sum) {
+                $cnt++;
+            }
+            $tmp = 0;
+        }
+        return $cnt;
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1100-1199/1100.Find K-Length Substrings With No Repeated Characters/README_EN.md

@@ -243,6 +243,33 @@ function numKLenSubstrNoRepeats(s: string, k: number): number {
 }
 ```
 
+### **PHP**
+
+```php
+class Solution {
+    /**
+     * @param String $s
+     * @param Integer $k
+     * @return Integer
+     */
+    function numKLenSubstrNoRepeats($s, $k) {
+        $sum = ($k * ($k + 1)) / 2 - $k;
+        $cnt = $tmp = 0;
+        for ($i = 0; $i < strlen($s) - $k + 1; $i++) {
+            $str = substr($s, $i, $k);
+            for ($j = 0; $j < $k; $j++) {
+                $tmp += strpos($str, $str[$j]);
+            }
+            if ($tmp === $sum) {
+                $cnt++;
+            }
+            $tmp = 0;
+        }
+        return $cnt;
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1100-1199/1100.Find K-Length Substrings With No Repeated Characters/Solution.php

@@ -0,0 +1,22 @@
+class Solution {
+    /**
+     * @param String $s
+     * @param Integer $k
+     * @return Integer
+     */
+    function numKLenSubstrNoRepeats($s, $k) {
+        $sum = ($k * ($k + 1)) / 2 - $k;
+        $cnt = $tmp = 0;
+        for ($i = 0; $i < strlen($s) - $k + 1; $i++) {
+            $str = substr($s, $i, $k);
+            for ($j = 0; $j < $k; $j++) {
+                $tmp += strpos($str, $str[$j]);
+            }
+            if ($tmp === $sum) {
+                $cnt++;
+            }
+            $tmp = 0;
+        }
+        return $cnt;
+    }
+}