标签：复杂度 通过 NPU div not 开始 const under amp
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.
public int minSubArrayLen(int s, int[] nums) {//my int sum =0; int index = 0;//当前子序列开始的位置 int len =nums.length+1;//最小长度 for(int i =0;i<nums.length;i++){ sum += nums[i]; while(sum>=s){//如果sum>=s则左指针向右滑动 if((i-index+1)<len){ len = i-index+1; } sum -= nums[index]; index++; } } return len>nums.length?0:len; }
LeetCode-209.Minimum Size Subarray Sum
标签：复杂度 通过 NPU div not 开始 const under amp
原文地址：https://www.cnblogs.com/zhacai/p/10976310.html
