Leetcode-713 subarray with product less than k

class Solution(object):
    def numSubarrayProductLessThanK(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: int
        """
        if k <= 1: return 0
        left, right, multi, ans = 0, 0, 1, 0

        while right < len(nums):

            multi *= nums[right] #  Take the right element as the pivot

            while multi >= k: #  Find the corresponding pivot The point on the left of the longest window 
                multi //= nums[left]
                left += 1
           

            ans += right - left + 1 #  Statistics to pivot The right side of the array is the child element of 
            right += 1

        return ans