leetcode-674. 最长连续递增序列-C语言

int findLengthOfLCIS(int* nums, int numsSize){
    int i;
    int max = 0;
    int tmp = 0;
    
    if(!nums || !numsSize) 
        return 0;
    
    //printf("numsSize = %d \n", numsSize);
    
    for(i=0; i<numsSize-1; i++){
        if(nums[i] < nums[i+1]){
            tmp++;
            if(tmp > max){
                max = tmp;
                //printf("i = %d, max = %d \n", i, max);
            }            
        } else {
            tmp = 0;
        }
    }
    
    return max+1;
}