Array-Subarray Product Less Than K

最新推荐文章于 2025-08-14 11:49:44 发布

kevin聪

最新推荐文章于 2025-08-14 11:49:44 发布

阅读量241

点赞数

CC 4.0 BY-SA版权

分类专栏：算法与数据结构 leetcode 文章标签：算法数据结构 leetcode

本文链接：https://blog.csdn.net/LaputaFallen/article/details/78821395

算法与数据结构同时被 2 个专栏收录

569 篇文章

订阅专栏

leetcode

557 篇文章

订阅专栏

本文介绍了一种算法，用于计算一个正整数数组中所有连续子数组的数量，这些子数组的乘积小于给定阈值k。通过维护一个滑动窗口，可以有效地解决这个问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description:

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

Note:

0 < nums.length <= 50000.
0 < nums[i] < 1000.
0 <= k < 10^6.

Solution:

//prod实际上保存leftmost(以right为尾部，所有元素之积小于k)到right之间的乘积，每次右移right,如果prod小于k，那么新增的right - left + 1实际上是以right为尾数,满足乘积小于k的子串个数,如果prod大于等于k，那么在循环累除nums[left]的同时右移left，直到找到以right为尾数满足条件的最左left
class Solution {
    public int numSubarrayProductLessThanK(int[] nums, int k) {
        if (k <= 1) return 0;
        int prod = 1, ans = 0, left = 0;
        for (int right = 0; right < nums.length; right++) {
            prod *= nums[right];
            while (prod >= k) prod /= nums[left++];
            ans += right - left + 1;
        }
        return ans;
    }
}