Problem:
Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray).
Example 1:
Input: [1,3,5,4,7]
Output: 3
Explanation: The longest continuous increasing subsequence is [1,3,5], its length is 3.
Even though [1,3,5,7] is also an increasing subsequence, it‘s not a continuous one where 5 and 7 are separated by 4.
Example 2:
Input: [2,2,2,2,2]
Output: 1
Explanation: The longest continuous increasing subsequence is [2], its length is 1.
Note: Length of the array will not exceed 10,000.
思路：
Solution (C++):
int findLengthOfLCIS(vector<int>& nums) {
if (nums.empty()) return 0;
int n = nums.size(), count = 1, res = 1;
for (int i = 1; i < n; ++i) {
if (nums[i] > nums[i-1]) ++count;
else count = 1;
res = max(res, count);
}
return res;;
}
性能：
Runtime: 12 ms??Memory Usage: 7.1 MB
思路：
Solution (C++):
性能：
Runtime: ms??Memory Usage: MB
674. Longest Continuous Increasing Subsequence
原文：https://www.cnblogs.com/dysjtu1995/p/12725071.html