https://leetcode.cn/problems/subarray-product-less-than-k/直接滑动窗口，上双指针class Solution { public int numSubarrayProductLessThanK(int[] nums, int k) {

https://leetcode.cn/problems/minimum-size-subarray-sum/我是菜比，只能想到个这😅暴力解法class Solution { public int minSubArrayLen(int target, int[] nums) {