子数组乘积小于K

题目

input：[10,5,2,6],100
output：8

思路

暴力解法，注意记录count的方式，可能会漏掉

代码

def count_min_c(nums,k):
    count = 0
    for i in range(len(nums)):
        mul = 1
        for j in range(len(nums)):
            mul *= nums[j]
            if mul>=k:
                break
            count +=1
    return count