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.
Input: nums = [1,2,3], k = 0
Output: 0
조건
1 <= nums.length <= 3 * 104
1 <= nums[i] <= 1000
0 <= k <= 106
class Solution:
def numSubarrayProductLessThanK(self, nums: List[int], k: int) -> int:
l, r, answer = 0, 0, 0
product = 1
if k <= 1:
return 0
while r < len(nums):
product *= nums[r]
while product >= k:
product /= nums[l]
l += 1
answer += r - l + 1
r += 1
print(product,r, l, answer)
return answer