674. Longest Continuous Increasing Subsequence

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.

题意：找出连续升序子数组最长

c++代码：

class Solution {
public:
    int findLengthOfLCIS(vector<int>& nums) {
        int n=nums.size();
        if(!n) return 0;
        vector<int> v;
        v.push_back(1);
        for(int i=0;i<n-1;i++)
        {
            if(nums[i]<nums[i+1])
            {
                v[v.size()-1]++;
            }
            else
            {
                v.push_back(1);
            }
        }
        int max=0;
        for(int i=0;i<v.size();i++)
        {
            if(max<v[i])
                max=v[i];
        }
        return max;
    }
};

以后只做评分高点的题了。