subarray-product-less-than-k

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an array of integers <code>nums</code> and an integer <code>k</code>, return the number of contiguous subarrays where the product of all the elements in the subarray is strictly less than <code>k</code>.

&nbsp;
Example 1:

<pre>
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.
</pre>

Example 2:

<pre>
Input: nums = [1,2,3], k = 0
Output: 0
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 3 * 104</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 1000</code></li>
	<li><code>0 &lt;= k &lt;= 106</code></li>
</ul>

numSubarrayProductLessThanK

Subarray Product Less Than K

Maximum Product Subarray

maximum-product-subarray

乘积最大子数组

Maximum Size Subarray Sum Equals k

maximum-size-subarray-sum-equals-k

和等于 k 的最长子数组长度

Subarray Sum Equals K

subarray-sum-equals-k

和为 K 的子数组

Two Sum Less Than K

two-sum-less-than-k

小于 K 的两数之和

Number of Smooth Descent Periods of a Stock

number-of-smooth-descent-periods-of-a-stock

股票平滑下跌阶段的数目

Count Subarrays With Score Less Than K

count-subarrays-with-score-less-than-k

统计得分小于 K 的子数组数目

Array

Binary Search

Prefix Sum

Sliding Window

给你一个整数数组 <code>nums</code> 和一个整数 <code>k</code> ，请你返回子数组内所有元素的乘积严格小于 <code>k</code> 的连续子数组的数目。
&nbsp;

示例 1：

<pre>
输入：nums = [10,5,2,6], k = 100
输出：8
解释：8 个乘积小于 100 的子数组分别为：[10]、[5]、[2]、[6]、[10,5]、[5,2]、[2,6]、[5,2,6]。
需要注意的是 [10,5,2] 并不是乘积小于 100 的子数组。
</pre>

示例 2：

<pre>
输入：nums = [1,2,3], k = 0
输出：0</pre>

&nbsp;

提示:&nbsp;

<ul>
	<li><code>1 &lt;= nums.length &lt;= 3 * 104</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 1000</code></li>
	<li><code>0 &lt;= k &lt;= 106</code></li>
</ul>