[leetcode]-674. Longest Continuous Increasing Subsequence（C语言）

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

Example 1:

Input: [1,3,5,4,7]
Output: 3
Explanation: 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: 1
Explanation: 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;
    if(numsSize==1)
        return 1;
    int res=1,sum=1;
    int i,j,k,l;
    for(i=0;i<numsSize-1;i++)
    {
        for(j=i+1;j<numsSize;j++)
        {
            if(nums[j-1]>=nums[j])
            {
                i=j-1;
                break;
            }
            else
                sum++;
        }
        if(sum>res)
            res=sum;
        sum=1;
    }
    return res;
}