Longest Continuous Increasing Subsequence Solution Java
class Solution {\n  public int findLengthOfLCIS(int[] nums) {\n    int ans = 0;\n\n    for (int l = 0, r = 0; r < nums.length; ++r) {\n      if (r > 0 && nums[r
class Solution {\n  public int findLengthOfLCIS(int[] nums) {\n    int ans = 0;\n\n    for (int l = 0, r = 0; r < nums.length; ++r) {\n      if (r > 0 && nums[r] <= nums[r - 1])\n        l = r;\n      ans = Math.max(ans, r - l + 1);\n    }\n\n    return ans;\n  }\n}\n
['Array']