[algorithm] sword finger offer2 golang interview question 8: the shortest subarray with a sum greater than or equal to K

[ Algorithm ] The finger of the sword offer2 golang Interview questions 8： And greater than or equal to k The shortest subarray of

subject 1:

Ideas 1: The sliding window

// Ideas :  The sliding window 
// The pointer  [left,right]  Record the interval of continuous subarray , And record the interval and  sum
//if sum < target; right ++ ;sum += nums[right]
//if sum >= target;  Update minimum length  minLen; sum -= nums[left]; left++

Code

func minSubArrayLen(target int, nums []int) int {
    
    // Ideas :  The sliding window 
    // The pointer  [left,right]  Record the interval of continuous subarray , And record the interval and  sum
    //if sum < target; right ++ ;sum += nums[right]
    //if sum >= target;  Update minimum length  minLen; sum -= nums[left]; left++
    
    // Processing parameters 
    if len(nums) ==0 || target <= 0{
    
        return -1
    }

    // The sliding window 
    minLen := 0
    left,right,sum := 0,0,nums[0]
    for left <= right{
    
        if sum < target {
    
            right ++
            // There will be pointer overflow here  todo
            if right  == len(nums) {
    
                return minLen
            }
            sum += nums[right]
        }else {
    
            // Update minimum length 
            tempLen := right - left + 1
            if tempLen < minLen || minLen == 0{
    
                minLen = tempLen
            }
            sum -= nums[left]
            left ++
        }
    }
    return minLen
}

test