Untitled

 avatar
unknown
plain_text
2 years ago
609 B
2
Indexable
class Solution {
    public int minSubArrayLen(int target, int[] nums) {
        int minLen = Integer.MAX_VALUE;

        for (int i = 0; i < nums.length; i++) {
            int sum = 0;
            for (int j = i; j < nums.length; j++) {
                sum += nums[j];
                
                if (sum == target) {
                    minLen = Math.min(minLen, j - i + 1);
                    break;
                } else if (sum > target) {
                    break;
                }
            }
        }

        return (minLen == Integer.MAX_VALUE) ? 0 : minLen;
    }
}