Write a function to find number of subarrays with product less than K

Write a function to find number of subarrays with product less than K

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: medium

标签: interviewbit, data-structure, topic-specific, data-structures, algorithms

参考答案摘要

Input: arr = [1, 6, 2, 3, 2, 1], k = 12 Output: 11 int numSubarrayProductLessThanK(vector& nums, int k) { int ans=0; int pdt=1; int left=0,right=0; while(right<=nums.size()-1){ pdt*=nums[right]; ...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。