leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

0713.cpp (428B)

0 class Solution { 1 public: 2 int numSubarrayProductLessThanK(vector<int> &nums, int k) { 3 int res = 0, count = 0, prod = 1, start = 0; 4 ; 5 for (int i = 0; i < nums.size(); i++) { 6 prod *= nums[i]; 7 while (prod >= k && start <= i) { 8 prod /= nums[start++]; 9 count--; 10 } 11 res += i - start + 1; 12 } 13 return res; 14 } 15 };