LeetCode-Minimum Size Subarray Sum

Description：
Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn’t one, return 0 instead.

Example:

Input: s = 7, nums = [2,3,1,2,4,3]
Output: 2
Explanation: the subarray [4,3] has the minimal length under the problem constraint.

Follow up:

• If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log n).

题意：在一个整型数组中找到一个最短的连续子数组，这个连续子数组需要满足其中所有元素的和要不小于给定的值

解法：利用滑动窗口来解决这个问题，假设此时滑动窗口的大小为count，其中所有元素的值为sum，右边界为k,我们一直将k往右边移动（同时需要更新count和sum）直到sum的值不小于给定的值，这个时候我们可以缩短左边界直到刚好不满足条件为止，此时便得到一个满足条件的连续子数组（加上左边界左侧一个元素）；更新最短连续子数组的长度；重复上面的过程；

Java

class Solution {
    public int minSubArrayLen(int s, int[] nums) {
        int count = 0;
        int res = nums.length + 1;
        int sum = 0;
        for (int i = 0; i < nums.length; i++) {
            sum += nums[i];
            count++;
            if (sum >= s) {
                while (sum >= s) {
                    sum -= nums[i - count + 1];
                    count--;
                } 
                res = Math.min(res, count + 1);
            }
        }
        return res == nums.length + 1 ? 0 : res;
    }
}