@@ -0,0 +1,752 @@
+package me.wayne.leetcodetop100.slidingwindow;%0A%0A/**%0A * %E7%BB%99%E5%AE%9A%E4%B8%80%E4%B8%AA%E5%90%AB%E6%9C%89 n %E4%B8%AA%E6%AD%A3%E6%95%B4%E6%95%B0%E7%9A%84%E6%95%B0%E7%BB%84%E5%92%8C%E4%B8%80%E4%B8%AA%E6%AD%A3%E6%95%B4%E6%95%B0 target %E3%80%82%0A * %3Cp%3E%0A * %E6%89%BE%E5%87%BA%E8%AF%A5%E6%95%B0%E7%BB%84%E4%B8%AD%E6%BB%A1%E8%B6%B3%E5%85%B6%E5%92%8C %E2%89%A5 target %E7%9A%84%E9%95%BF%E5%BA%A6%E6%9C%80%E5%B0%8F%E7%9A%84 %E8%BF%9E%E7%BB%AD%E5%AD%90%E6%95%B0%E7%BB%84 %5Bnumsl, numsl+1, ..., numsr-1, numsr%5D%0A * %EF%BC%8C%E5%B9%B6%E8%BF%94%E5%9B%9E%E5%85%B6%E9%95%BF%E5%BA%A6%E3%80%82%E5%A6%82%E6%9E%9C%E4%B8%8D%E5%AD%98%E5%9C%A8%E7%AC%A6%E5%90%88%E6%9D%A1%E4%BB%B6%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%EF%BC%8C%E8%BF%94%E5%9B%9E 0 %E3%80%82%0A * %3Cp%3E%0A * %E9%93%BE%E6%8E%A5%EF%BC%9Ahttps://leetcode-cn.com/problems/minimum-size-subarray-sum%0A */%0Apublic class LC209_MinSubArrayLen %7B%0A%0A    public int minSubArrayLen(int target, int%5B%5D nums) %7B%0A        int res = Integer.MAX_VALUE;%0A        int left = 0;%0A        int right = 0;%0A        int sum = 0;%0A        while (right %3C nums.length) %7B%0A            sum += nums%5Bright++%5D;%0A            while (sum %3E= target) %7B%0A                res = Math.min(res, right - left);%0A                sum -= nums%5Bleft++%5D;%0A            %7D%0A        %7D%0A%0A        return res == Integer.MAX_VALUE ? 0 : res;%0A    %7D%0A%7D%0A

add LC209_MinSubArrayLen