Sword finger offer II 009. subarray with product less than k

The finger of the sword Offer II 009. The product is less than K Subarray

Given an array of positive integers nums And integer k , Please find out that the product in the array is less than k The number of successive subarrays of .

Example 1:

Input : nums = [10,5,2,6], k = 100
Output : 8
explain : 8 The product is less than 100 The subarrays of are : [10], [5], [2], [6], [10,5], [5,2], [2,6], [5,2,6].
It should be noted that [10,5,2] It's not that the product is less than 100 Subarray .

Example 2:

Input : nums = [1,2,3], k = 0
Output : 0
The solution code is as follows ：

int numSubarrayProductLessThanK(int* nums, int numsSize, int k){
    
    int count=0;
    

    int i,j;
    for(i=0;i<numsSize;i++){
    
        if(nums[i]<k){
    
            count++;
        }
        int sum=nums[i];
        for(j=i+1;j<numsSize;j++){
    
            sum=sum*nums[j];
            if(sum<k){
    
                count++;
            }
            else{
    
                break;
            }

        }
    }

    
    return count;


}