【Leetcode】713. Subarray Product Less Than K 乘积小于K的子数组

解法 呃……居然忘记了尺取法……python class Solution: def numSubarrayProductLessThanK(self, nums: List[int], k: int) -> int: if k<=1: return 0 n = len(nums) l = 0 prod
相关文章
相关标签/搜索