Please solve the programming task below using a self-contained code snippet in a markdown code block.

Given an unsorted array of integers 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].
 
Please complete the following python code precisely:
```python
class Solution:
    def findLengthOfLCIS(self, nums: List[int]) -> int:
```