#713
Subarray Product Less Than K
specialist · 805 · lc medium +31 · verified · 54% accepted · 7,489 likes · top 46%
Description
Given an integer array nums and an integer k, count and return the total number of contiguous subarrays whose element product is strictly less than k.
Example 1:
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.
Example 2:
Input: nums = [1,2,3], k = 0
Output: 0
Code
1
2
3