Subarray Product Less Than K

最新推荐文章于 2021-07-20 12:58:11 发布

Goofiness

最新推荐文章于 2021-07-20 12:58:11 发布

阅读量106

点赞数

分类专栏： leetcode 文章标签： leetcode python

本文链接：https://blog.csdn.net/byr_wy/article/details/85176894

版权

leetcode 专栏收录该内容

232 篇文章 0 订阅

订阅专栏

Subarray Product Less Than K

Your are given an array of positive integers nums.
Count and print the number of (contiguous) subarrays where the product of all the elements in the subarray is less than k.

Example

Input: nums = [10, 5, 2, 6], k = 100
Output: 8
Explanation: The 8 subarrays that have product less than 100 are: [10], [5], [2], [6], [10, 5], [5, 2], [2, 6], [5, 2, 6].
Note that [10, 5, 2] is not included as the product of 100 is not strictly less than k.

Solution

class Solution:
    def numSubarrayProductLessThanK(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: int
        """
        if k<=1:
            return 0
        start = count = 0
        product = 1
        for end,val in enumerate(nums):
            product*= val
            while product>=k:
                product//= nums[start]
                start+= 1
            count+= (end - start+1)
        return count