Easy JAVA Solution One Pass (On - time, O1 - space)
\nclass Solution {\n  public int findLengthOfLCIS(int[] nums) {\n    int res = 0, temp = 1;\n\n    for (int i = 1; i < nums.length; i++) {\n      int curr = num
```\nclass Solution {\n  public int findLengthOfLCIS(int[] nums) {\n    int res = 0, temp = 1;\n\n    for (int i = 1; i < nums.length; i++) {\n      int curr = nums[i];\n      int prev = nums[i-1];\n\n      if (prev < curr) {\n        temp++;\n      } else {\n        res = Math.max(res, temp);\n        temp = 1;\n      }\n    }\n    return  Math.max(res, temp);\n  }\n}\n```
['Java']