Leetcode 713. Subarray double pointers whose product is less than k

Original link ：Leetcode 713. The product is less than K Subarray

class Solution {
    
public:
    int numSubarrayProductLessThanK(vector<int>& nums, int k) {
    
        int l=0,r=0,tmp=1,res=0;
        while(r<nums.size())
        {
    
            tmp*=nums[r++];
            while(l<r && tmp>=k) tmp/=nums[l++];
            res+=(r-l);
        }
        return res;
    }
};