leetcode 674. Longest Continuous Increasing Subsequence

1.题目

Given an unsorted array of integers, find the length of longest continuous increasing subsequence.
给一个未排序的整型数组，寻找最长连续递增子序列的长度。
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.

2.分析

遍历一遍数组
用一个计数器count来计算当前递增子序列的长度，maxC保存目前最大的长度。
递增子序列断掉时，判断count是否大于maxC，更新maxC，count重置。

3.代码

int findLengthOfLCIS(vector<int>& nums) {    if (nums.size() < 1)        return 0;    int count = 1;    int maxC = 1;    for (int i = 1; i < nums.size(); i++) {        if (nums[i] > nums[i - 1])            ++count;            else {                maxC = maxC > count ? maxC : count;                count = 1;            }        }        return maxC = maxC > count ? maxC : count;    }}