剑指 Offer II 008. 和大于等于 target 的最短子数组

[题目链接](剑指 Offer II 008. 和大于等于 target 的最短子数组 - 力扣（LeetCode） (leetcode-cn.com))

代码

class Solution {
    public int minSubArrayLen(int target, int[] nums) {
        int ans = nums.length+1; 
        int left = 0, right = 1;
        int num;
        //双指针，排除目标数组只有一个数的情况
        if(nums.length > 1) num = nums[0] + nums[1];
        else num = nums[0];
        while(right < nums.length && left < nums.length) { //防止溢出
            int len = nums.length+1; //初始目标长度设置为数组长度+1
            if(nums[left] >= target) { //最左边的数大于目标值
                len = 1;//目标长度为1
                num -= nums[left];
                if(left < nums.length)  left++;//指针左移
            } else if(num < target){
                if(right < nums.length) {
                    right++;
                    if(right < nums.length) num += nums[right];
                }
            } else {
                num -= nums[left];
                len = right - left + 1;
                if(left < nums.length) left++;
            }
            ans = Math.min(ans,len);
        }
        if(ans == nums.length + 1) ans = 0;
        return ans;
    }
}

代码2

class Solution {
    public int minSubArrayLen(int target, int[] nums) {
        int l = 0;
        int num = nums[l];
        int ans = nums.length+1;
        for(int r = 0; r < nums.length; ) {
            //System.out.println("l = " + l + " r = " + r + " num = " + num);
            boolean flag = false;
            if(num >= target){
                ans = Math.min(ans,r-l+1);
                num-=nums[l];
                if(l == r) {
                    r++;
                    flag = true;
                }
                l++;
            }
            else {
                r++;
                flag = true;
            }
            if(r < nums.length && flag) num += nums[r];
        }
        if(ans == nums.length + 1) ans = 0;
        return ans;
    }
}