674-longest-continuous-increasing-subsequence.md Added another solution in Python.

gazeldx · gazeldx · commit f4ff34a991a6 · 2025-02-08T13:10:58.000+08:00
diff --git a/en/1-1000/674-longest-continuous-increasing-subsequence.md b/en/1-1000/674-longest-continuous-increasing-subsequence.md
@@ -84,6 +84,7 @@ class Solution {
 ```
 
 ## Python
+### Solution 1
 ```python
 class Solution:
     def findLengthOfLCIS(self, nums: List[int]) -> int:
@@ -99,6 +100,25 @@ class Solution:
         return max(dp)
 ```
 
+### Solution 2
+```python
+class Solution:
+    def findLengthOfLCIS(self, nums: List[int]) -> int:
+        result = 1
+        current_length = 1
+
+        for i in range(1, len(nums)):
+            if nums[i] > nums[i - 1]:
+                current_length += 1
+
+                if current_length > result:
+                    result = current_length
+            else:
+                current_length = 1
+
+        return result
+```
+
 ## C++
 ```cpp
 // Welcome to create a PR to complete the code of this language, thanks!
diff --git a/zh/1-1000/674-longest-continuous-increasing-subsequence.md b/zh/1-1000/674-longest-continuous-increasing-subsequence.md
@@ -84,6 +84,7 @@ class Solution {
 ```
 
 ## Python
+### Solution 1
 ```python
 class Solution:
     def findLengthOfLCIS(self, nums: List[int]) -> int:
@@ -99,6 +100,25 @@ class Solution:
         return max(dp)
 ```
 
+### Solution 2
+```python
+class Solution:
+    def findLengthOfLCIS(self, nums: List[int]) -> int:
+        result = 1
+        current_length = 1
+
+        for i in range(1, len(nums)):
+            if nums[i] > nums[i - 1]:
+                current_length += 1
+
+                if current_length > result:
+                    result = current_length
+            else:
+                current_length = 1
+
+        return result
+```
+
 ## C++
 ```cpp
 // Welcome to create a PR to complete the code of this language, thanks!
