Given a list of integers, write a function to find the longest continuous increasing subsequence. Return the length of the longest continuous increasing subsequence.
Example:
Input:
[1, 3, 5, 4, 7]
Output:
3
Make sure you return your solution, don't print!
AI
Bot
Trying to solve my challenge? Ask if you must, or press the purple button so I can analyze your code.