Python Easy Solution without Sliding Window, O(n), 54ms, beats 93.23% with Explanation
Explanation\n1. Edge case if there is only one element in nums\n2. add a counter and a max counter (in case the maximum is at beginning)\n3. iterate through num
**Explanation**\n1. Edge case if there is only one element in nums\n2. add a counter and a max counter (in case the maximum is at beginning)\n3. iterate through nums:\n\t4. if it\'s the first element, continue (no previous, will evoke error)\n\t5. each time the element is greater than the previous one (increasing), add 1 to counter\n\t6. if not, check if the counter is the largest one yet (if it\'s largest subarray yet)\n\t\t7. if yes, update max counter\n\t\t8. reset counter to 1\n7. check if last counter is max (edge case)\n8. return max counter\n\n```\nclass Solution(object):\n    def findLengthOfLCIS(self, nums):\n        """\n        :type nums: List[int]\n        :rtype: int\n        """\n        if len(nums) == 1:\n            return 1\n        \n        counter = 1\n        max_counter = 0\n        for i in range(len(nums)):\n            if i == 0:\n                continue\n            else:  \n                if nums[i] > nums[i-1]:\n                    counter += 1\n                else:\n                    if counter > max_counter:\n                        max_counter = counter\n                    counter = 1\n        if counter > max_counter:\n            max_counter = counter\n        \n        return max_counter\n```\n\n**If you liked this, please upvote to support me!**
['Python']