【遍历数组】674. Longest Continuous Increasing Subsequence

class Solution {
public:
    int findLengthOfLCIS(vector<int>& num) {
        if(num.size()<1)
            return 0;
        int ans=1,flag=INT_MIN;
        for(int i = 1;i<num.size();i++)
        {
            if(num[i]>num[i-1])
                ans++;
            else
            {
                flag=max(flag,ans);
                ans=1;
            }
                
        }
        return max(flag,ans);
    }
};