解法 呃……竟然忘记了尺取法…… class Solution: def numSubarrayProductLessThanK(self, nums: List[int], k: int) -> int: if k<=1: return 0 n = len(nums) l = 0 prod = 1 ans = 0 for r,val in enumerate(nums): prod *= val while prod>=k: prod /= nums[l] l += 1 ans += r-l+1 return ans