题目原文:
Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn’t one, return 0 instead.
For example, given the array [2,3,1,2,4,3] and s = 7,
the subarray [4,3] has the minimal length under the problem constraint.
题目大意:
给出一个正整数的数组,和一个整数s,求出使得和值≥s的最小长度。
题目分析:
使用两个指针start和end,end向后移到sum>s,然后start向右移,直到sum<s,并更新minLength值。End指针移动到结尾时循环,返回minLength.(源自西施豆腐渣博客)
源码:(language:java)
public class Solution {
public int minSubArrayLen(int s, int[] nums) {
int start = 0;
int end = 0;
int sum = 0;
int min = Integer.MAX_VALUE;
while(start<nums.length && end<nums.length) {
while(sum<s && end<nums.length) {
sum += nums[end++];
}
while(sum>=s && start<=end) {
min = Math.min(min, end-start);
sum -= nums[start++];
}
}
return min==Integer.MAX_VALUE ? 0 : min;
}
}
成绩:
1ms,beats 18.63%,众数1ms,81.30%
Cmershen的碎碎念:
这道题一开始想到的是排序后再从后向前查找(因为数字大才有可能序列短嘛。),这个解法显然是错误的,因为会打乱原顺序,但提交时竟然只有2个test case没通过,且暴力枚举之,竟超越了100%……