# 0674. Longest Continuous Increasing Subsequence
###### tags: `Leetcode` `FaceBook` `Easy` `Sliding Window`
Link: https://leetcode.com/problems/longest-continuous-increasing-subsequence/
## Code

class Solution {
    public int findLengthOfLCIS(int[] nums) {
        int ans = 0;
        int l = 0, r = 1;
        int count = 0;
        while(r < nums.length){
            if(nums[r]>nums[r-1]) count++;
            else{
                l = r;
                count = 0;
            }
            if(count>ans) ans = count;
            r++;
        }
        return ans+1;
    }
}