Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 674 with 15 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 674 # by problem number
lcpy gen -s longest_continuous_increasing_subsequence # by problem name
nums, return the length of the longest continuous increasing subsequence (i.e. subarray). The subsequence must be strictly increasing.
A continuous increasing subsequence is defined by two indices l and r (l < r) such that it is [nums[l], nums[l + 1], ..., nums[r - 1], nums[r]] and for each l <= i < r, nums[i] < nums[i + 1].
Input: nums = [1,3,5,4,7]
Output: 3
Input: nums = [2,2,2,2,2]
Output: 1
1 <= nums.length <= 10^4-10^9 <= nums[i] <= 10^9class Solution:
# Time: O(n)
# Space: O(1)
def find_length_of_lcis(self, nums: list[int]) -> int:
best = 1
run = 1
for i in range(1, len(nums)):
if nums[i - 1] < nums[i]:
run += 1
best = max(best, run)
else:
run = 1
return best
| Time | Space |
|---|---|
| O(n) | O(1) |