674. Longest Continuous Increasing Subsequence

 static int wing=[]()
 {
     std::ios::sync_with_stdio(false);
     cin.tie(NULL);
     return ;
 }();

 class Solution
 {
 public:
     int findLengthOfLCIS(vector<int>& nums)
     {
         int sz=nums.size();
         if(sz<)
             return sz;
         int count=;
         int res=INT_MIN;
         for(int i=;i<sz;i++)
         {
             if(nums[i]>nums[i-])
                 count++;
             else
             {
                 res=max(res,count);
                 count=;
             }
         }
         return max(res,count);
     }
 };

扫描一遍，问题不大