forked from yubinbai/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.java
More file actions
48 lines (43 loc) · 1.38 KB
/
Solution.java
File metadata and controls
48 lines (43 loc) · 1.38 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
public class Solution {
public int minSubArrayLen(int s, int[] nums) {
if (nums.length == 0) return 0;
int total = nums[0];
int start = 0, end = 0;
int ret = nums.length + 1;
while (start <= end && end < nums.length) {
if (total < s) {
if (end + 1 < nums.length) {
end++;
total += nums[end];
} else {
break;
}
} else if (start <= end) {
ret = Math.min(ret, end - start + 1);
total -= nums[start];
start++;
}
}
return ret == nums.length + 1 ? 0 : ret;
}
public static void main(String[] args) {
Solution s = new Solution();
int[] arr;
int sum;
arr = new int[] {5, 1, 3, 5, 10, 7, 4, 9, 2, 8};
sum = 15;
System.out.println(s.minSubArrayLen(sum, arr));
arr = new int[] {2, 3, 1, 2, 4, 3};
sum = 7;
System.out.println(s.minSubArrayLen(sum, arr));
arr = new int[] {};
sum = 100;
System.out.println(s.minSubArrayLen(sum, arr));
arr = new int[] {1, 4, 4};
sum = 4;
System.out.println(s.minSubArrayLen(sum, arr));
arr = new int[] {1, 2, 3, 4, 5};
sum = 11;
System.out.println(s.minSubArrayLen(sum, arr));
}
}