feat: add php solution to lc problem: No.0647 (doocs#968)

Author: Qiu-IT

solution/0600-0699/0674.Longest Continuous Increasing Subsequence/README.md

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

solution/0600-0699/0674.Longest Continuous Increasing Subsequence/README_EN.md

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

solution/0600-0699/0674.Longest Continuous Increasing Subsequence/Solution.php

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