Golang Leetcode 713. Subarray Product Less Than K.go

思路

滑动窗口

code

func numSubarrayProductLessThanK(nums []int, k int) int {
	if k <= 1 {
		return 0
	}
	count, left, one := 0, 0, 1
	for right := 0; right < len(nums); right++ {
		one *= nums[right]
		for one >= k {
			one /= nums[left]
			left++
		}
		count += right - left + 1
	}
	return count
}

更多内容请移步我的repo：https://github.com/anakin/golang-leetcode