|
| 1 | +package solutions; |
| 2 | + |
| 3 | +// [Problem] https://leetcode.com/problems/minimum-size-subarray-sum |
| 4 | +class MinimumSizeSubarraySum { |
| 5 | + // Sliding window |
| 6 | + // O(n) time, O(1) space |
| 7 | + public int minSubArrayLen(int target, int[] nums) { |
| 8 | + int left = 0, minLength = Integer.MAX_VALUE, sum = 0; |
| 9 | + for (int right = 0; right < nums.length; right++) { |
| 10 | + sum += nums[right]; |
| 11 | + while (sum >= target) { |
| 12 | + minLength = Math.min(minLength, right - left + 1); |
| 13 | + sum -= nums[left++]; |
| 14 | + } |
| 15 | + } |
| 16 | + return minLength == Integer.MAX_VALUE ? 0 : minLength; |
| 17 | + } |
| 18 | + |
| 19 | + // Test |
| 20 | + public static void main(String[] args) { |
| 21 | + MinimumSizeSubarraySum solution = new MinimumSizeSubarraySum(); |
| 22 | + |
| 23 | + int[] nums1 = {2, 3, 1, 2, 4, 3}; |
| 24 | + int target1 = 7; |
| 25 | + int expectedOutput1 = 2; |
| 26 | + int actualOutput1 = solution.minSubArrayLen(target1, nums1); |
| 27 | + System.out.println("Test 1 passed? " + (expectedOutput1 == actualOutput1)); |
| 28 | + |
| 29 | + int[] nums2 = {1, 4, 4}; |
| 30 | + int target2 = 4; |
| 31 | + int expectedOutput2 = 1; |
| 32 | + int actualOutput2 = solution.minSubArrayLen(target2, nums2); |
| 33 | + System.out.println("Test 2 passed? " + (expectedOutput2 == actualOutput2)); |
| 34 | + } |
| 35 | +} |
0 commit comments