LeetCode 713. Subarray Product Less Than K

最新推荐文章于 2025-05-16 07:15:00 发布
转载 最新推荐文章于 2025-05-16 07:15:00 发布 · 127 阅读 · 0 ·
本内容遵循CC 4.0 BY-SA版权协议
原文链接：http://www.cnblogs.com/rookielet/p/10620886.html
本文介绍了一种使用双指针法解决数组中连续子数组乘积小于特定值K的问题。通过调整两个指针的位置，算法可以高效地遍历整个数组并计算满足条件的子数组数量。

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

题解：

很快想到了two pointer的解法，但是一直被corner case困住。

两个典型的case

[1,2,3]

0

这个情况是可能导致j < i，所以要加上j= Math.max(i, j)

还有

[1,1,1,8,1,1,1,1,1,1,1,1,1]

5

除以8可能导致prod = 0，仅仅当i < j的时候才能做除法

class Solution {
    public int numSubarrayProductLessThanK(int[] nums, int k) {
        int prod = 1;
        int res = 0;
        for(int i = 0, j = 0; i < nums.length; i++) {
            j = Math.max(i, j);
            while(j < nums.length && prod * nums[j] < k) {
                prod *= nums[j++];
            }
            res += j - i;
            if(i < j) prod /= nums[i];
        }
        return res;
    }
}

 

转载于:https://www.cnblogs.com/rookielet/p/10620886.html

dianguju2418
关注
Leetcode 713. Subarray Product Less Than K
weixin_43876597的博客
06-23 188
Leetcode 713. Subarray Product Less Than K Input: nums = [10, 5, 2, 6], k = 100 Output: 8 index:0 [10], [10, 5], ans = 2 index: 1 [5], [5,2], [5,2,6], ans = 5 index: 2 [2], [2, 6], ans = 7 index: 3 [6], ans =8 Approach #2: Sliding Window [Accepted] Input:
Leetcode 713 Subarray Product Less Than K
weixin_43796689的博客
09-28 135
Leetcode 713 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 1: Input: nums = [10,
LeetCode //C - 713. Subarray Product Less Than K
最新发布
Made in Code
05-16 719
The question requires calculating the number of all consecutive subarrays in the array whose product is strictly less than a given integer k. If k is less than or equal to 1, return 0 directly, because no positive product will be less than 1. Use the slidi
leetcode 713 Subarray Product Less Than K
MRxjh的博客
12-01 373
Java class Solution { public int numSubarrayProductLessThanK(int[] nums, int k) { if(k<2) return 0; int res=0,sum=1; for(int sta=0,end=0;end<nums.length;end++){
【LeetCode】713. Subarray Product Less Than K 乘积小于 K 的子数组
负雪明烛
10-14 2487
给你一个整数数组 nums 和一个整数 k ，请你返回子数组内所有元素的乘积严格小于 k 的连续子数组的数目
LeetCode-713. Subarray Product Less Than K
zy2317878的博客
05-10 277
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...
【LeetCode】713. Subarray Product Less Than K
天行健，君子以自强不息
07-01 252
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 ...
[LeetCode] 713. Subarray Product Less Than K
u013383813的博客
03-09 130
题：https://leetcode.com/problems/subarray-product-less-than-k/ 思路 这个的 滑动窗口 很有意思， while 循环中 不是为了 获得 结果，而是 对 窗口 进行修正。 因为 本身 窗口 是 答案的解。 这里 有 看见 了 一种 新思路。 从 统计答案的角度来说，是从 窗口 的右端来统计。 以窗口 左端为 子串尾部 的 数量。 clas...
LeetCode 713 Subarray Product Less Than K (两点法)
Tc的专栏
09-23 330
Your are given an array of positive integersnums. Count and print the number of (contiguous) subarrays where the product of all the elements in the subarray is less thank. Example 1: Input: nums...
leetcode713. Subarray Product Less Than K
weixin_44245188的博客
11-01 483
注意，对于某一个值，我们只关注以它为最右边元素的子数组。这样可以减少重复讨论的麻烦。思路：使用滑动窗口的思路，找取每一个符合条件的小窗，统计其内部子数组数量。
[leetcode] 713. Subarray Product Less Than K
Learning from the mistakes
07-24 190
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: Inp...
leetcode 713. Subarray Product Less Than K
weixin_30952535的博客
07-07 103
Prefix product or two pointer can both solve this problem. But don't forget to take a look at the note Note: 0 < nums.length <= 50000. 0 < nums[i] < 1000. 0 <= k < 10^6. which means...
LeetCode #713 - Subarray Product Less Than K
LawFile的博客
02-06 180
题目描述： 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...
LeetCode 713. Subarray Product Less Than K(java)
katrina95的博客
02-25 359
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
leetcode - 713. Subarray Product Less Than K
sinat_41679123的博客
11-26 551
leetcode - 713
【Leetcode】713. Subarray Product Less Than K
数学、算法爱好者的博客
01-14 236
题目地址： https://leetcode.com/problems/subarray-product-less-than-k/ 给定一个正整数长nnn的数组AAA，再给定一个非负整数kkk，问AAA中有多少个子数组的乘积是小于kkk的。 思路是双指针。开左右两个指针jjj和iii，再用一个变量维护∏A[j:i]\prod A[j:i]∏A[j:i]，枚举子数组右端点，如果乘积小于kkk，那么以A[i]A[i]A[i]为右端点的满足条件的子数组的个数就是i−j+1i-j+1i−j+1；否则右移左指针直到乘
leetcode713——Subarray Product Less Than K
tzyshiwolaogongya的博客
08-01 272
题目大意：给出一个正整数数组，求出数组中有多少个子数组，满足子数组中的乘积小于给定的k 分析：双指针问题。暴力枚举肯定超时，考虑使用双指针，ij维护子数组的开始和结束，遍历数组，p维持子数组的乘积，p初始值为1，不断乘上nums[j]得到子数组的乘积，当乘积小于k时，说明从i到j满足要求，新加入的子数组个数就是j-i+1；当乘积大于等于k时，说明这个子数组已经不满足范围了，所以右移子数组的开始指...
[Leetcode] 713. Subarray Product Less Than K 解题报告
魔豆（Magicbean）的博客
02-07 671
题目： 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:
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值