[Java/C++]Clean solution
The idea is to use cnt to record the length of the current continuous increasing subsequence which ends with nums[i], and use res to record the maximum cnt.\n\n
The idea is to use ```cnt``` to record the length of the current continuous increasing subsequence which ends with ```nums[i]```, and use ```res``` to record the maximum ```cnt```.\n\nJava version:\n```\n    public int findLengthOfLCIS(int[] nums) {\n        int res = 0, cnt = 0;\n        for(int i = 0; i < nums.length; i++){\n            if(i == 0 || nums[i-1] < nums[i]) res = Math.max(res, ++cnt);\n            else cnt = 1;\n        }\n        return res;\n    }\n```\n\nC++ version:\n```\n    int findLengthOfLCIS(vector<int>& nums) {\n        int res = 0, cnt = 0;\n        for(int i = 0; i < nums.size(); i++){\n            if(i == 0 || nums[i-1] < nums[i]) res = max(res, ++cnt);\n            else cnt = 1;\n        }\n        return res;\n    }\n```
[]