leetcode 674. Longest Continuous Increasing Subsequence

原题：

Given an unsorted array of integers, find the length of longest continuous increasing subsequence.

Example 1:

Input: [1,3,5,4,7]Output: 3Explanation: The longest continuous increasing subsequence is [1,3,5], its length is 3. Even though [1,3,5,7] is also an increasing subsequence, it's not a continuous one where 5 and 7 are separated by 4. 

Example 2:

Input: [2,2,2,2,2]Output: 1Explanation: The longest continuous increasing subsequence is [2], its length is 1. 

Note: Length of the array will not exceed 10,000.

总感觉这个题目做过一遍呵。。。

代码如下：

int findLengthOfLCIS(int* nums, int numsSize) {    if(numsSize==0)        return 0;    int max=0;    int temp=1;    for(int n=1;n<numsSize;n++)    {        if(*(nums+n)>*(nums+n-1))        {            temp++;        }        else        {            if(temp>max)                max=temp;            temp=1;        }    }    if(temp>max)        return temp;    return max;}

遍历一遍就好。