Leetcode/209. Minimum Size Subarray Sum.java at main · chakrabortyrajarshi2005/Leetcode · GitHub

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
49
50
51
52
53
54
55
56
57
58
209. Minimum Size Subarray Sum
Solved
Medium
Topics
premium lock icon
Companies
Given an array of positive integers nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal to target. If there is no such subarray, return 0 instead.


Example 1:

Input: target = 7, nums = [2,3,1,2,4,3]
Output: 2
Explanation: The subarray [4,3] has the minimal length under the problem constraint.
Example 2:

Input: target = 4, nums = [1,4,4]
Output: 1
Example 3:

Input: target = 11, nums = [1,1,1,1,1,1,1,1]
Output: 0


Constraints:

1 <= target <= 109
1 <= nums.length <= 105
1 <= nums[i] <= 104


Follow up: If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log(n)).class Solution {
    public int minSubArrayLen(int target, int[] nums) {
        int i = 0;
        int minLength = Integer.MAX_VALUE;
        int currentSum = 0;

        for (int j = 0; j < nums.length; j++) {
            currentSum += nums[j];

            while (currentSum >= target) {
                if ((j - i + 1) < minLength) {
                    minLength = j - i + 1;
                } else {
                    currentSum -= nums[i];
                    i++;
                }
            }
        }

        if (minLength != Integer.MAX_VALUE) {
            return minLength;
        } else {
            return 0;
        }
    }
}