mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 19:44:45 +08:00
@ -150,19 +150,20 @@ class Solution:
|
|||||||
Java:
|
Java:
|
||||||
```java
|
```java
|
||||||
class Solution {
|
class Solution {
|
||||||
public int minSubArrayLen(int target, int[] nums) {
|
|
||||||
Integer size = Integer.MAX_VALUE;
|
// 滑动窗口
|
||||||
int from = 0;
|
public int minSubArrayLen(int s, int[] nums) {
|
||||||
int to = 0;
|
int left = 0;
|
||||||
int sum = 0;
|
int sum = 0;
|
||||||
while (to < nums.length) {
|
int result = Integer.MAX_VALUE;
|
||||||
sum += nums[to++];
|
for (int right = 0; right < nums.length; right++) {
|
||||||
while (sum >= target) {
|
sum += nums[right];
|
||||||
size = Math.min(size,to - from);
|
while (sum >= s) {
|
||||||
sum -= nums[from++];
|
result = Math.min(result, right - left + 1);
|
||||||
|
sum -= nums[left++];
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
return size == Integer.MAX_VALUE ? 0 : size;
|
return result == Integer.MAX_VALUE ? 0 : result;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
```
|
```
|
||||||
|
Reference in New Issue
Block a user