31 lines
679 B
Java
31 lines
679 B
Java
/*
|
|
* @lc app=leetcode id=209 lang=java
|
|
*
|
|
* [209] Minimum Size Subarray Sum
|
|
*/
|
|
|
|
// @lc code=start
|
|
class Solution {
|
|
public int minSubArrayLen(int target, int[] nums) {
|
|
if(nums == null || nums.length == 0) {
|
|
return 0;
|
|
}
|
|
int sum = 0, i = 0, min = 0;
|
|
for(int j = 0; j<nums.length; j++) {
|
|
sum += nums[j];
|
|
while(sum >= target) {
|
|
if(min == 0) {
|
|
min = j - i + 1;
|
|
} else {
|
|
min = Math.min(j-i+1, min);
|
|
}
|
|
sum -= nums[i];
|
|
i++;
|
|
}
|
|
}
|
|
return min;
|
|
}
|
|
}
|
|
// @lc code=end
|
|
|