Java solution (Beats 100%)
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int findLengthOfLCIS(int[] nums) \n    {\n        int max = 0;\n\n        int cur = 1;\n\n        for (int i = 0; i < nums.length - 1; i++)\n        {\n            if (nums[i] < nums[i + 1]) cur++;\n            else\n            {\n                if (cur > max) max = cur;\n                cur = 1;\n            }\n        }    \n\n        if (cur > max) max = cur;\n\n        return max;\n    }\n}\n```
['Array', 'Java']