FromLeetcodeStatus回头复习下DateJun 2, 2024Tags滑动窗口Difficulty中等Linkhttps://leetcode.cn/problems/subarray-product-less-than-k/description/题面给你一个整数数组nums和一个整数k,请你返回子数组内所有元素的乘积严格小于k的连续子数组的数目。示例 1:示例 2:提示:1 <= nums.length <= 3 * 1041 <= nums[i] <= 10000 <= k <= 106思路 题解